SKI combinator calculus is a computational system that may be perceived as a reduced version of untyped Lambda calculus. 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.

PropertyValue
dbpprop:abstract
  • SKI combinator calculus is a computational system that may be perceived as a reduced version of untyped Lambda calculus. 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 typesettability, 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, or more simply as KS(SK), instead of being fully drawn as a tree (as formality and readability would require).
  • SKI 组合子演算是一个计算系统，它是对无类型版本的 Lambda 演算的简约。这个系统声称在 Lambda 演算中所有运算都可以用三个组合子 S、K 和 I 来表达。 在这个系统中的所有函数可以只使用 S、K、I 的字母表和圆括号（分组符号）来表达。通常假定组合子是左结合的，从而在不影响执行次序的情况下精简表达式中的圆括号。
dbpprop:date
  • January 2008
dbpprop:discuss
  • Talk:Combinatory logic Merger proposal
dbpprop:hasPhotoCollection
dbpprop:reference
dbpprop:wikiPageUsesTemplate
rdfs:comment
  • SKI combinator calculus is a computational system that may be perceived as a reduced version of untyped Lambda calculus. 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.
  • SKI 组合子演算是一个计算系统，它是对无类型版本的 Lambda 演算的简约。这个系统声称在 Lambda 演算中所有运算都可以用三个组合子 S、K 和 I 来表达。 在这个系统中的所有函数可以只使用 S、K、I 的字母表和圆括号（分组符号）来表达。通常假定组合子是左结合的，从而在不影响执行次序的情况下精简表达式中的圆括号。
rdfs:label
  • SKI combinator calculus
  • SKI组合子演算
owl:sameAs
skos:subject
foaf:page
is dbpprop:disambiguates of
is dbpprop:redirect of