{
  "aliases": [
    "typed-lambda-calculi"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn mathematics and computer science, a **typed lambda calculus** is a typed formalism that uses the lambda symbol ($\\lambda$) to denote anonymous function abstraction. In this context, types are usually objects of a syntactic nature that are assigned to lambda terms; the exact nature of a type depends on the calculus considered (see kinds below). From a certain point of view, typed lambda calculi can be seen as refinements of the untyped lambda calculus, but from another point of view, they can also be considered the more fundamental theory and *untyped lambda calculus* a special case with only one type.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "aliases": [
      "typed-lambda-calculi"
    ],
    "inventory": [
      "Y36786VX03"
    ],
    "kind": "concept",
    "name": "Typed lambda calculus",
    "same_as": {
      "wikidata": "Q2607208",
      "wikipedia": "Typed lambda calculus"
    },
    "sources": [
      {
        "locator": "Typed lambda calculus",
        "mention": "wikipedia://en/366208",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:366208@r1318206586"
      }
    ],
    "tag": "SNNY92DV7R"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/SNNY92DV7R/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/SNNY92DV7R.md",
  "msc": null,
  "name": "Typed lambda calculus",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/SNN/SNNY92DV7R.md",
  "status": null,
  "tag": "SNNY92DV7R",
  "uri": "m2://SNNY92DV7R",
  "url": "https://math2.tamnd.com/wiki/typed-lambda-calculus/",
  "writing": {
    "tag": "SNNY92DV7R",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}
