A domain model characterising strong normalisation
From MaRDI portal
Publication:958484
DOI10.1016/J.APAL.2008.06.005zbMath1153.03006OpenAlexW2153778836MaRDI QIDQ958484
Publication date: 5 December 2008
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2008.06.005
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notions of computation and monads
- Counterexamples to termination for the direct sum of term rewriting systems
- Complete restrictions of the intersection type discipline
- Adding algebraic rewriting to the untyped lambda calculus
- LCF considered as a programming language
- An elementary proof of strong normalization for intersection types
- Short proofs of normalization for the simply-typed \(\lambda\)-calculus, permutative conversions and Gödel's \(\mathbf T\)
- Normalization without reducibility
- A filter lambda model and the completeness of type assignment
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- Termination for direct sums of left-linear complete term rewriting systems
- Definitions by rewriting in the Calculus of Constructions
- Continuous Lattices and Domains
- Strong normalisation for applied lambda calculi
- New Computational Paradigms
- Logical Approaches to Computational Barriers
This page was built for publication: A domain model characterising strong normalisation
