A proof of strong normalisation using domain theory

DOI10.2168/LMCS-3(4:12)2007MaRDI QIDQ5453505zbMATH OpenOpenAlexFDO

Authors Thierry Coquand, Arnaud Spiwack

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

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• A domain model characterising strong normalisation
• Continuous semantics for strong normalisation
• New Computational Paradigms
• Computer Science Logic
• Strong normalisation for applied lambda calculi

Cited in

(8)

• Continuous semantics for strong normalisation
• On the Values of Reducibility Candidates
• The Peirce translation
• Size-based termination of higher-order rewriting
• scientific article; zbMATH DE number 7393562 (Why is no real title available?)
• Constructive Mathematics and Functional Programming (Abstract)
• Realizability at work: separating two constructive notions of finiteness
• A domain model characterising strong normalisation

This page was built for publication: A proof of strong normalisation using domain theory

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