Strong normalisation for applied lambda calculi
From MaRDI portal
Recommendations
Cited in
(22)- Strong normalizability of typed lambda-calculi for substructural logics
- The ant-lion paradigm for strong normalization
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- Strong normalization from weak normalization by translation into the lambda-I-calculus
- Continuous normalization for the lambda-calculus and Gödel's T
- Abstracting models of strong normalization for classical calculi
- A behavioural model for Klop's calculus
- Continuous semantics for strong normalisation
- The equivalence of bar recursion and open recursion
- scientific article; zbMATH DE number 2080223 (Why is no real title available?)
- Asymptotically almost all \lambda-terms are strongly normalizing
- scientific article; zbMATH DE number 7269245 (Why is no real title available?)
- Non-determinism, non-termination and the strong normalization of System T
- Constructive forcing, CPS translations and witness extraction in interactive realizability
- scientific article; zbMATH DE number 6792338 (Why is no real title available?)
- Computer Science Logic
- Strong Normalization of a Typed Lambda Calculus for Intuitionistic Bounded Linear-time Temporal Logic
- A proof of strong normalisation using domain theory
- scientific article; zbMATH DE number 2242601 (Why is no real title available?)
- New Computational Paradigms
- Uniform strong normalization for multi-discipline calculi
- A domain model characterising strong normalisation
This page was built for publication: Strong normalisation for applied lambda calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310640)