See lambda calculus in All languages combined, or Wiktionary
Download JSON data for lambda calculus meaning in English (4.4kB)
{
"etymology_text": "Coined by Alonzo Church after the use of the Greek letter lambda (λ) as the basic abstraction operator in the calculus.",
"forms": [
{
"form": "lambda calculi",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~",
"2": "lambda calculi"
},
"expansion": "lambda calculus (countable and uncountable, plural lambda calculi)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"derived": [
{
"word": "simply typed lambda calculus"
},
{
"word": "typed lambda calculus"
}
],
"examples": [
{
"ref": "2009 February 3, John C. Baez with Mike Stay, “Physics, Topology, Logic and Computation: A Rosetta Stone”, in (Please provide the book title or journal name), page 50",
"text": "In the 1930s, while Turing was developing what are now called ‘Turing machines’ as a model for computation, Church and his student Kleene were developing a different model, called the ‘lambda calculus’ [29, 63]. While a Turing machine can be seen as an idealized, simplified model of computer hardware, the lambda calculus is more like a simple model of software.",
"type": "quotation"
}
],
"glosses": [
"Any of a family of functionally complete algebraic systems in which lambda expressions are evaluated according to a fixed set of rules to produce values, which may themselves be lambda expressions."
],
"id": "en-lambda_calculus-en-noun-5fhjLs3e",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"functionally complete",
"functionally complete"
],
[
"lambda expression",
"lambda expression"
]
],
"meronyms": [
{
"word": "alpha conversion"
},
{
"word": "beta reduction"
},
{
"word": "eta conversion"
},
{
"word": "lambda term"
}
],
"raw_glosses": [
"(computing theory) Any of a family of functionally complete algebraic systems in which lambda expressions are evaluated according to a fixed set of rules to produce values, which may themselves be lambda expressions."
],
"related": [
{
"word": "calculus"
},
{
"word": "lambda"
},
{
"word": "lambda abstraction"
},
{
"word": "lambda expression"
},
{
"word": "combinator"
},
{
"word": "functionally complete"
},
{
"word": "recursive function"
},
{
"word": "Turing machine"
}
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"code": "ca",
"lang": "Catalan",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "càlcul lambda"
},
{
"code": "cs",
"lang": "Czech",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "lambda kalkul"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "algebraic system",
"word": "lambdakalkyyli"
},
{
"code": "el",
"lang": "Greek",
"roman": "logismós lámda",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "λογισμός λάμδα"
},
{
"code": "is",
"lang": "Icelandic",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "lambda-reikningur"
},
{
"code": "it",
"lang": "Italian",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "calcolo lambda"
},
{
"code": "ja",
"lang": "Japanese",
"sense": "algebraic system",
"word": "λ計算"
},
{
"code": "ja",
"lang": "Japanese",
"roman": "ramuda keisan",
"sense": "algebraic system",
"word": "ラムダ計算"
},
{
"code": "mk",
"lang": "Macedonian",
"roman": "lambda-presmetka",
"sense": "algebraic system",
"tags": [
"feminine"
],
"word": "ламбда-пресметка"
},
{
"code": "pl",
"lang": "Polish",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "rachunek lambda"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "algebraic system",
"tags": [
"neuter"
],
"word": "calcul lambda"
},
{
"code": "ru",
"lang": "Russian",
"roman": "ljambda-isčislenije",
"sense": "algebraic system",
"tags": [
"neuter"
],
"word": "лямбда-исчисление"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "lambda račun"
},
{
"code": "sv",
"lang": "Swedish",
"sense": "algebraic system",
"tags": [
"common-gender"
],
"word": "lambdakalkyl"
}
],
"wikipedia": [
"Alonzo Church",
"lambda calculus"
]
}
],
"word": "lambda calculus"
}
{
"derived": [
{
"word": "simply typed lambda calculus"
},
{
"word": "typed lambda calculus"
}
],
"etymology_text": "Coined by Alonzo Church after the use of the Greek letter lambda (λ) as the basic abstraction operator in the calculus.",
"forms": [
{
"form": "lambda calculi",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~",
"2": "lambda calculi"
},
"expansion": "lambda calculus (countable and uncountable, plural lambda calculi)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"meronyms": [
{
"word": "alpha conversion"
},
{
"word": "beta reduction"
},
{
"word": "eta conversion"
},
{
"word": "lambda term"
}
],
"pos": "noun",
"related": [
{
"word": "calculus"
},
{
"word": "lambda"
},
{
"word": "lambda abstraction"
},
{
"word": "lambda expression"
},
{
"word": "combinator"
},
{
"word": "functionally complete"
},
{
"word": "recursive function"
},
{
"word": "Turing machine"
}
],
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms with quotations",
"English uncountable nouns",
"en:Theory of computing"
],
"examples": [
{
"ref": "2009 February 3, John C. Baez with Mike Stay, “Physics, Topology, Logic and Computation: A Rosetta Stone”, in (Please provide the book title or journal name), page 50",
"text": "In the 1930s, while Turing was developing what are now called ‘Turing machines’ as a model for computation, Church and his student Kleene were developing a different model, called the ‘lambda calculus’ [29, 63]. While a Turing machine can be seen as an idealized, simplified model of computer hardware, the lambda calculus is more like a simple model of software.",
"type": "quotation"
}
],
"glosses": [
"Any of a family of functionally complete algebraic systems in which lambda expressions are evaluated according to a fixed set of rules to produce values, which may themselves be lambda expressions."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"functionally complete",
"functionally complete"
],
[
"lambda expression",
"lambda expression"
]
],
"raw_glosses": [
"(computing theory) Any of a family of functionally complete algebraic systems in which lambda expressions are evaluated according to a fixed set of rules to produce values, which may themselves be lambda expressions."
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Alonzo Church",
"lambda calculus"
]
}
],
"translations": [
{
"code": "ca",
"lang": "Catalan",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "càlcul lambda"
},
{
"code": "cs",
"lang": "Czech",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "lambda kalkul"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "algebraic system",
"word": "lambdakalkyyli"
},
{
"code": "el",
"lang": "Greek",
"roman": "logismós lámda",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "λογισμός λάμδα"
},
{
"code": "is",
"lang": "Icelandic",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "lambda-reikningur"
},
{
"code": "it",
"lang": "Italian",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "calcolo lambda"
},
{
"code": "ja",
"lang": "Japanese",
"sense": "algebraic system",
"word": "λ計算"
},
{
"code": "ja",
"lang": "Japanese",
"roman": "ramuda keisan",
"sense": "algebraic system",
"word": "ラムダ計算"
},
{
"code": "mk",
"lang": "Macedonian",
"roman": "lambda-presmetka",
"sense": "algebraic system",
"tags": [
"feminine"
],
"word": "ламбда-пресметка"
},
{
"code": "pl",
"lang": "Polish",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "rachunek lambda"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "algebraic system",
"tags": [
"neuter"
],
"word": "calcul lambda"
},
{
"code": "ru",
"lang": "Russian",
"roman": "ljambda-isčislenije",
"sense": "algebraic system",
"tags": [
"neuter"
],
"word": "лямбда-исчисление"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "algebraic system",
"tags": [
"masculine"
],
"word": "lambda račun"
},
{
"code": "sv",
"lang": "Swedish",
"sense": "algebraic system",
"tags": [
"common-gender"
],
"word": "lambdakalkyl"
}
],
"word": "lambda calculus"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-06 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.