|
|
|
Summary Of: Combinatory logic
Combinatory logic was originally intended as a... of combinatory logic typically exceeds that of... published nothing on combinatory logic after his original 1924 paper... theoretical computer science began taking an interest in combinatory logic in the 1960s and 70s... For a more modern parallel treatment of combinatory logic and the lambda calculus... devised for combinatory logic in the 1960s and 70s... combinatory logic is used as a simplified model of... combinatory logic captures many essential features of computation... Combinatory logic can be viewed as a variant of the... Hence combinatory logic has been used to model some... Combinatory logic can be given a variety of interpretations... evaluating expressions in combinatory logic is much simpler... a typed combinatory logic corresponds to a... Encyclodia Page On: Combinatory logic
|
These Are Links To Other Documents
|
combinational logic |  | SKI combinator calculus | merged | Discuss | Moses Schönfinkel | Haskell Curry | variables | mathematical logic | computer science | computation | functional programming languages | higher-order function | quantified variables | Quine's | predicate functor logic | expressive power | first-order logic | predicate functor logic | Moses Schönfinkel | Stalin | Princeton University | Alonzo Church | Princeton | 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 | Θ | citation needed | 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 | Curry, Haskell B. | Feys, Robert | Curry, Haskell B. | Hindley, J. Roger | ISBN | 0-7204-2208-6 | ISBN 0-201-19249-7 | Hindley, J. Roger | Journal of Symbolic Logic | MR | 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 | Stanford Encyclopedia of Philosophy | Categories | Lambda calculus | Logic in computer science | Combinatory logic | Articles to be merged from January 2008 | All articles to be merged | All articles with unsourced statements | Articles with unsourced statements | |
|
|
 |
