H ?
«
‹
←
→
›
»
Language peer sets for Schoenfinkel:
United States↑ United States/1924↑ Designed 1924 ↑ 1920s languages ↑ Pre-Computing↑ Pre-War↑ Genus Algebraic ↑ Excluded from Sammet ↑ Algebraic↑ Mathematical↑ Expression-oriented ↑ Algebraic/1924↑ Mathematical/1924↑ Expression-oriented/1924↑ Algebraic/United States↑ Mathematical/United States↑ Expression-oriented/United States↑ Excluded from Sammet ↑ Excluded from Sammet/1924↑ Excluded from Sammet/us ↑ ## Schoenfinkel(ID:6364/)## Schoenfinkel's combinatory algebraalternate simple viewCountry: United States Designed 1924 Genus: Algebraic Sammet category: Excluded from Sammet A combinatory calculus that showed that three combinators (S, K and I) were all that was needed to express the caclulus. Partly picked up by Church (the formalism of the function being used for the Lambda Calculus) and partly picked up by Curry (the combinatorial aspect) Related languages
References: Schoenfinkel
Extract:
Lambda Calculus
Extract:
Extension and Intension
in [Proceedings] (2000) Workshop on History of Logics, Types and Rewriting Heriot-Watt University, Edinburgh Tuesday 5 December 2000
in [Proceedings] (2000) Workshop on History of Logics, Types and Rewriting Heriot-Watt University, Edinburgh Tuesday 5 December 2000
Search in: Google Google scholar World Cat Yahoo Overture DBLP Monash bib NZ IEEE ACM portal CiteSeer CSB ncstrl jstor Bookfinder |