-calculi with explicit substitutions preserving strong normalization
From MaRDI portal
Publication:1290510
Recommendations
- \(\lambda\)-calculi with explicit substitutions and composition which preserve \(\beta\)-strong normalization
- λν, a calculus of explicit substitutions which preserves strong normalisation
- scientific article; zbMATH DE number 1342288
- A \(\lambda\)-calculus with explicit weakening and explicit substitution
- Explicit substitution. On the edge of strong normalization
Cited in
(26)- scientific article; zbMATH DE number 1420789 (Why is no real title available?)
- Strong normalizability of typed lambda-calculi for substructural logics
- Preservation of strong normalisation modulo permutations for the structural \(\lambda\)-calculus
- A note on preservation of strong normalisation in the \(\lambda \)-calculus
- The structural \(\lambda \)-calculus
- A faithful and quantitative notion of distant reduction for generalized applications
- Explicit substitutions and reducibility
- Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract)
- An abstract factorization theorem for explicit substitutions
- scientific article; zbMATH DE number 2086241 (Why is no real title available?)
- scientific article; zbMATH DE number 1088029 (Why is no real title available?)
- A Theory of Explicit Substitutions with Safe and Full Composition
- The λse-calculus does not preserve strong normalisation
- Proof nets and explicit substitutions
- Curry-Style Explicit Substitutions for the Linear and Affine Lambda Calculus
- Strong Normalization of Herbelin's Explicit Substitution Calculus with Substitution Propagation
- A \(\lambda\)-calculus with explicit weakening and explicit substitution
- Conservation and uniform normalization in lambda calculi with erasing reductions
- scientific article; zbMATH DE number 1512610 (Why is no real title available?)
- Factorization and normalization, essentially
- A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications
- \(\lambda\)-calculi with explicit substitutions and composition which preserve \(\beta\)-strong normalization
- Delayed Substitutions
- Combinatory reduction systems with explicit substitution that preserve strong normalisation
- The Expansion Problem in Lambda Calculi with Explicit Substitution
- Strong normalization of substitutions
This page was built for publication: \(\lambda\)-calculi with explicit substitutions preserving strong normalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290510)