Normal forms in combinatory logic

DOI10.1305/ndjfl/1040408614zbMath0830.03005OpenAlexW2028830311MaRDI QIDQ1903133

Patricia Johann

Publication date: 30 January 1996

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1040408614

zbMATH Keywords

normal formlambda calculuscombinatory logicterm rewriting systemreduction relation

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items

Normal forms in combinatory logic, On pairs of dual consequence operations, A combinatory logic approach to higher-order E-unification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatory logic approach to higher-order E-unification
• Combinatory logic. With two sections by William Craig.
• The lambda calculus. Its syntax and semantics. Rev. ed.
• On pseudo-c\(\beta\) normal form in combinatory logic
• Polymorphic rewriting conserves algebraic strong normalization
• Adding algebraic rewriting to the untyped lambda calculus
• A unification algorithm for typed \(\overline\lambda\)-calculus
• Polymorphic rewriting conserves algebraic confluence
• Higher-order unification revisited: Complete sets of transformations
• Normal forms in combinatory logic
• Combinatory logic. Vol. II
• Combinatory Reductions and Lambda Reductions Compared
• Strong reduction and normal form in combinatory logic
• Axioms for strong reduction in combinatory logic
• The decidability of hindley's axioms for strong reduction
• A Short Proof of Curry's Normal Form Theorem