Matches in DBpedia 2014 for { <http://dbpedia.org/resource/SKI_combinator_calculus> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- SKI_combinator_calculus abstract "SKI combinator calculus is a computational system that may be perceived as a reduced version of untyped lambda calculus. It can be thought of as a computer programming language, though it is not useful for writing software. Instead, it is important in the mathematical theory of algorithms because it is an extremely simple Turing complete language.All operations in lambda calculus are expressed in SKI as binary trees whose leaves are one of the three symbols S, K, and I (called combinators). In fact, the symbol I is added only for convenience, and just the other two suffice for all of the purposes of the SKI system.Although the most formal representation of the objects in this system requires binary trees, they are usually represented, for typesetability, as parenthesized expressions, either with all the subtrees parenthesized, or only the right-side children subtrees parenthesized. So, the tree whose left subtree is the tree KS and whose right subtree is the tree SK is usually typed as ((KS)(SK)), or more simply as KS(SK), instead of being fully drawn as a tree (as formality and readability would require).".
- SKI_combinator_calculus wikiPageExternalLink combinators.html.
- SKI_combinator_calculus wikiPageExternalLink index.htm.
- SKI_combinator_calculus wikiPageExternalLink combinator_calculus.
- SKI_combinator_calculus wikiPageExternalLink birds.html.
- SKI_combinator_calculus wikiPageExternalLink ECS-LFCS-89-85.
- SKI_combinator_calculus wikiPageID "1232841".
- SKI_combinator_calculus wikiPageRevisionID "602276324".
- SKI_combinator_calculus hasPhotoCollection SKI_combinator_calculus.
- SKI_combinator_calculus subject Category:Combinatory_logic.
- SKI_combinator_calculus subject Category:Lambda_calculus.
- SKI_combinator_calculus comment "SKI combinator calculus is a computational system that may be perceived as a reduced version of untyped lambda calculus. It can be thought of as a computer programming language, though it is not useful for writing software. Instead, it is important in the mathematical theory of algorithms because it is an extremely simple Turing complete language.All operations in lambda calculus are expressed in SKI as binary trees whose leaves are one of the three symbols S, K, and I (called combinators).".
- SKI_combinator_calculus label "SKI combinator calculus".
- SKI_combinator_calculus label "SKIコンビネータ計算".
- SKI_combinator_calculus label "SKI组合子演算".
- SKI_combinator_calculus sameAs SKIコンビネータ計算.
- SKI_combinator_calculus sameAs m.04kn35.
- SKI_combinator_calculus sameAs Q857813.
- SKI_combinator_calculus sameAs Q857813.
- SKI_combinator_calculus wasDerivedFrom SKI_combinator_calculus?oldid=602276324.
- SKI_combinator_calculus isPrimaryTopicOf SKI_combinator_calculus.