A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus

DOI10.1007/978-3-642-45221-5_24zbMath1433.03038OpenAlexW62459810MaRDI QIDQ2870139

Willem Heijltjes, Tom Gundersen, Michel Parigot

Publication date: 17 January 2014

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45221-5_24

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Node Replication: Theory And Practice ⋮ The spirit of node replication

This page was built for publication: A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus