| 词条 | Binary combinatory logic |
| 释义 |
DefinitionSyntaxBackus–Naur form: SemanticsThe denotational semantics of BCL may be specified as follows:
where " Thus there are four equivalent formulations of BCL, depending on the manner of encoding the triplet (K, S, left parenthesis). These are The operational semantics of BCL, apart from eta-reduction (which is not required for Turing completeness), may be very compactly specified by the following rewriting rules for subterms of a given term, parsing from the left:
where See also
References1. ^1 {{citation|last=Tromp|first=John|title=Randomness and complexity|url=https://tromp.github.io/cl/LC.pdf|year=2007|pages=237–260|contribution=Binary lambda calculus and combinatory logic|publisher=World Sci. Publ., Hackensack, NJ|doi=10.1142/9789812770837_0014|mr=2427553|isbn=978-981-277-082-0|citeseerx=10.1.1.695.3142}}. 2. ^{{citation | last = Devine | first = Sean | doi = 10.3390/e11010085 | issue = 1 | journal = Entropy | mr = 2534819 | pages = 85–110 | title = The insights of algorithmic entropy | volume = 11 | year = 2009}}. External links
2 : Algorithmic information theory|Combinatory logic |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。