Continuous semantics for strong normalization
From MaRDI portal
Recommendations
Cited in
(18)- Continuous normalization for the lambda-calculus and Gödel's T
- Strong normalization in type systems: A model theoretical approach
- Breaking through the normalization barrier: a self-interpreter for F-omega
- On completeness of reducibility candidates as a semantics of strong normalization
- Continuous semantics for strong normalisation
- scientific article; zbMATH DE number 4055611 (Why is no real title available?)
- On continuous normalization
- A constructive analysis of learning in Peano arithmetic
- A generic strong normalization argument: Application to the calculus of constructions
- Size-based termination of higher-order rewriting
- Non-determinism, non-termination and the strong normalization of System T
- Strong normalisation for applied lambda calculi
- Computer Science Logic
- A proof of strong normalisation using domain theory
- Constructive Mathematics and Functional Programming (Abstract)
- On the Logical Strength of Confluence and Normalisation for Cyclic Proofs.
- Non-determinism in Gödel's system \(T\)
- A domain model characterising strong normalisation
This page was built for publication: Continuous semantics for strong normalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717056)