Pairing Without Conventional Restraints

DOI10.1002/MALQ.19740201902zbMath0299.02030OpenAlexW2084776839MaRDI QIDQ4053618

Hendrik Pieter 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

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

Related Items (10)

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

This page was built for publication: Pairing Without Conventional Restraints