See combinator on Wiktionary
{ "forms": [ { "form": "combinators", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "combinator (plural combinators)", "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": "other", "name": "Entries with translation boxes", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with 2 entries", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" }, { "kind": "other", "name": "Terms with Serbo-Croatian translations", "parents": [], "source": "w" }, { "kind": "topical", "langcode": "en", "name": "Computer science", "orig": "en:Computer science", "parents": [ "Computing", "Sciences", "Technology", "All topics", "Fundamental" ], "source": "w" } ], "derived": [ { "word": "supercombinator" } ], "examples": [ { "ref": "1991 December 20, Henk P. Barendregt, “Lambda Calculi With Types”, in ftp.cs.ru.nl^([ftp://ftp.cs.ru.nl/pub/CompMath.Found/HBK.ps]), retrieved 2012-07-15:", "text": "M is a closed λ-term (or combinator) if FV(M) = ∅. The set of closed λ-terms is denoted by Λ⁰.", "type": "quote" } ], "glosses": [ "A lambda expression which has no free variables in it." ], "id": "en-combinator-en-noun-mvNSL047", "links": [ [ "computer science", "computer science" ], [ "lambda expression", "lambda expression" ], [ "free variable", "free variable" ] ], "raw_glosses": [ "(computer science) A lambda expression which has no free variables in it." ], "topics": [ "computer", "computing", "engineering", "mathematics", "natural-sciences", "physical-sciences", "science", "sciences" ], "translations": [ { "code": "sh", "lang": "Serbo-Croatian", "sense": "lambda expression with no free variables", "tags": [ "masculine" ], "word": "kombinator" } ], "wikipedia": [ "combinator" ] } ], "sounds": [ { "ipa": "/ˈkɒm.bɪˌneɪ.tə(ɹ)/", "tags": [ "UK" ] }, { "ipa": "/ˈkɑm.bɪˌneɪ.tɚ/", "tags": [ "US" ] }, { "ipa": "[ˈkɑm.bɪˌneɪ.ɾɚ]", "tags": [ "US" ] }, { "audio": "en-us-combinator.ogg", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/40/En-us-combinator.ogg/En-us-combinator.ogg.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/4/40/En-us-combinator.ogg" } ], "word": "combinator" } { "forms": [ { "form": "combīnātor", "tags": [ "canonical" ] } ], "head_templates": [ { "args": { "1": "la", "2": "verb form", "head": "combīnātor" }, "expansion": "combīnātor", "name": "head" } ], "lang": "Latin", "lang_code": "la", "pos": "verb", "senses": [ { "categories": [ { "kind": "other", "name": "Latin entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "Pages with 2 entries", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" } ], "form_of": [ { "word": "combīnō" } ], "glosses": [ "second/third-person singular future passive imperative of combīnō" ], "id": "en-combinator-la-verb-WgBAaYgl", "links": [ [ "combīnō", "combino#Latin" ] ], "tags": [ "form-of", "future", "imperative", "passive", "second-person", "singular", "third-person" ] } ], "word": "combinator" }
{ "derived": [ { "word": "supercombinator" } ], "forms": [ { "form": "combinators", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "combinator (plural combinators)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English lemmas", "English nouns", "English terms with quotations", "Entries with translation boxes", "Pages with 2 entries", "Pages with entries", "Terms with Serbo-Croatian translations", "en:Computer science" ], "examples": [ { "ref": "1991 December 20, Henk P. Barendregt, “Lambda Calculi With Types”, in ftp.cs.ru.nl^([ftp://ftp.cs.ru.nl/pub/CompMath.Found/HBK.ps]), retrieved 2012-07-15:", "text": "M is a closed λ-term (or combinator) if FV(M) = ∅. The set of closed λ-terms is denoted by Λ⁰.", "type": "quote" } ], "glosses": [ "A lambda expression which has no free variables in it." ], "links": [ [ "computer science", "computer science" ], [ "lambda expression", "lambda expression" ], [ "free variable", "free variable" ] ], "raw_glosses": [ "(computer science) A lambda expression which has no free variables in it." ], "topics": [ "computer", "computing", "engineering", "mathematics", "natural-sciences", "physical-sciences", "science", "sciences" ], "wikipedia": [ "combinator" ] } ], "sounds": [ { "ipa": "/ˈkɒm.bɪˌneɪ.tə(ɹ)/", "tags": [ "UK" ] }, { "ipa": "/ˈkɑm.bɪˌneɪ.tɚ/", "tags": [ "US" ] }, { "ipa": "[ˈkɑm.bɪˌneɪ.ɾɚ]", "tags": [ "US" ] }, { "audio": "en-us-combinator.ogg", "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/4/40/En-us-combinator.ogg/En-us-combinator.ogg.mp3", "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/4/40/En-us-combinator.ogg" } ], "translations": [ { "code": "sh", "lang": "Serbo-Croatian", "sense": "lambda expression with no free variables", "tags": [ "masculine" ], "word": "kombinator" } ], "word": "combinator" } { "forms": [ { "form": "combīnātor", "tags": [ "canonical" ] } ], "head_templates": [ { "args": { "1": "la", "2": "verb form", "head": "combīnātor" }, "expansion": "combīnātor", "name": "head" } ], "lang": "Latin", "lang_code": "la", "pos": "verb", "senses": [ { "categories": [ "Latin entries with incorrect language header", "Latin non-lemma forms", "Latin verb forms", "Pages with 2 entries", "Pages with entries" ], "form_of": [ { "word": "combīnō" } ], "glosses": [ "second/third-person singular future passive imperative of combīnō" ], "links": [ [ "combīnō", "combino#Latin" ] ], "tags": [ "form-of", "future", "imperative", "passive", "second-person", "singular", "third-person" ] } ], "word": "combinator" }
Download raw JSONL data for combinator meaning in All languages combined (2.6kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-11-28 from the enwiktionary dump dated 2024-11-21 using wiktextract (65a6e81 and 0dbea76). 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.