Pairing Without Conventional Restraints

DOI10.1002/MALQ.19740201902MaRDI QIDQ4053618zbMATH OpenOpenAlexFDO

Authors Henk Barendregt

Publication date 1974

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19740201902

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Intuitionistic mathematics (03F55)

Cited in

(10)

• Applications of infinitary lambda calculus
• Unique normal forms for lambda calculus with surjective pairing
• Combinatory reduction systems: Introduction and survey
• Retracts of numerations
• Nominal rewriting
• Principal types for nominal theories
• Extended term rewriting systems
• Conditional linearization
• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
• Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL

This page was built for publication: Pairing Without Conventional Restraints

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