A glimpse into the paradise of combinatory algebra

DOI10.1007/BF00979873zbMath0551.68029OpenAlexW2060647547MaRDI QIDQ3343428

William Richard Stark

Publication date: 1984

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00979873

zbMATH Keywords

fixed pointsfunctional programmingfinite state automatontype-free lambda-calculuscombinatory algebrafoundations of computability theory

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Automata and formal grammars in connection with logical questions (03D05) Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• ALGOL 60
• Combinatory logic. With two sections by William Craig.
• Apparent variables from the standpoint of combinatory logic
• Combinatory logic. Vol. II
• Recursive functions of symbolic expressions and their computation by machine, Part I
• Can programming be liberated from the von Neumann style?
• Highlights of the History of the Lambda-Calculus
• Correspondence between ALGOL 60 and Church's Lambda-notation
• The next 700 programming languages

This page was built for publication: A glimpse into the paradise of combinatory algebra