{
  "annotation_id": "960610e3-7a1d-42bc-94ba-631f4325dbdd",
  "date_created": "2026-03-02T18:02:37.495000Z",
  "date_modified": "2026-03-02T18:02:37.495000Z",
  "file_hash": "1a5f2f379c67f70d11783046a103570db93a2ee9c5239164a0121882eef0d38d",
  "private": false,
  "record": {
    "abstract": "This paper introduces a formal metalanguage called the lambda-q calculus for\nthe specification of quantum programming languages. This metalanguage is an\nextension of the lambda calculus, which provides a formal setting for the\nspecification of classical programming languages. As an intermediary step, we\nintroduce a formal metalanguage called the lambda-p calculus for the\nspecification of programming languages that allow true random number\ngeneration. We demonstrate how selected randomized algorithms can be programmed\ndirectly in the lambda-p calculus. We also demonstrate how satisfiability can\nbe solved in the lambda-q calculus.",
    "arxiv_id": "quant-ph/9612052",
    "authors": [
      "Philip Maymin"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Extending the Lambda Calculus to Express Randomized and Quantumized   Algorithms",
    "url": "https://arxiv.org/abs/quant-ph/9612052"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "91bc73f8-d2da-4a6a-b0a0-a4296f81fac0",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}