A simplification of combinatory logic

DOI10.2307/2272970zbMATH Open0264.02024OpenAlexW2001469185MaRDI QIDQ5680100FDOQ5680100

Authors: Nicolas D. Goodman 

Publication date: 1972

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272970

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cited In (4)

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Call-by-value combinatory logic and the lambda-value calculus
• Predicate calculus and naive set theory in pure combinatory logic
• An extension of Klop's counterexample to the Church-Rosser property to \(\lambda\)-calculus with other ordered pair combinators

This page was built for publication: A simplification of combinatory logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5680100)