Site Navigation
Categories:
Lambda calculus
Logic in computer science
Combinatory logic
Articles to be merged since January 2008
All articles to be merged

Summary Of: Combinator

and combinator reduction is much simpler than lambda reduction... each primitive combinator comes with a reduction rule of the form... If we apply this combinator to any two terms... This combinator is equivalent to the earlier... point bases from which every combinator can be composed extensionally equal to... combinator according to rules similar to those presented above for the conversion of... were a combinator for detecting normal forms...

Encyclodia Page On: Combinator

These Are Links To Other Documents
| SKI combinator calculus | merged | Discuss | combinational logic | Moses Schönfinkel | Haskell Curry | variables | mathematical logic | functional programming languages | higher-order function | quantified variables | Quine's | predicate functor logic | first-order logic | predicate functor logic | Moses Schönfinkel | Stalin | University of Princeton | Alonzo Church | Princeton University | lambda calculus | Haskell Curry | Robert Feys | Belgium | models | Dana Scott | computation | computability theory | proof theory | lambda calculus | free variables | non-strict | functional programming | hardware | Unlambda | model theory | lambda calculus | formal parameter | normal form | left associative | formal parameter | Turing machines | Church-Turing thesis | free variables | extensionally equal | fixed point combinator | recursion | Θ | Iota | Schönfinkel | Curry | David Turner | Haskell Curry | B,C,K,W System | Schönfinkel | Church encodings | Rice's theorem | Functional programming languages | lambda calculus | SASL programming language | Kenneth E. Iverson | J programming language | APL | tacit programming | Curry-Howard isomorphism | intuitionistic logic | Hilbert system | proof theory | inclusion | Kripke frame | deduction theorem | SKI combinator calculus | B,C,K,W system | Fixed point combinator | graph reduction machine | supercombinators | Lambda calculus | Cylindric algebra | To Mock a Mockingbird | combinatory categorial grammar | Categorical abstract machine | Applicative computing systems | Hendrik Pieter Barendregt | ISBN 0-444-87508-5 | ISBN 0-7204-2208-6 | ISBN 0-201-19249-7 | Quine, W. V. | Moses Schönfinkel | Jean van Heijenoort | ISBN 0-674-32449-8 | Smullyan, Raymond | To Mock a Mockingbird | ISBN 0-394-53491-3 | ISBN 5-89158-101-9 | Categories | Lambda calculus | Logic in computer science | Combinatory logic | Articles to be merged since January 2008 | All articles to be merged |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Combinator".