A proof of strong normalisation using domain theory
From MaRDI portal
Publication:5453505
DOI10.2168/LMCS-3(4:12)2007zbMath1131.68038OpenAlexW3101018969MaRDI QIDQ5453505
Arnaud Spiwack, Thierry Coquand
Publication date: 1 April 2008
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-3(4:12)2007
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)
Related Items (4)
Size-based termination of higher-order rewriting ⋮ The Peirce translation ⋮ Constructive Mathematics and Functional Programming (Abstract) ⋮ On the Values of Reducibility Candidates
This page was built for publication: A proof of strong normalisation using domain theory
