Explicit substitution. On the edge of strong normalization
From MaRDI portal
Recommendations
Cites work
- -calculi with explicit substitutions and composition which preserve -strong normalization
- A note on simplification orderings
- Combinatory reduction systems with explicit substitution that preserve strong normalisation
- Explicit substitutions
- scientific article; zbMATH DE number 2185670 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- scientific article; zbMATH DE number 794240 (Why is no real title available?)
- ON STEPWISE EXPLICIT SUBSTITUTION
- λν, a calculus of explicit substitutions which preserves strong normalisation
Cited in
(15)- \(\lambda\)-calculi with explicit substitutions preserving strong normalization
- Lambda-calculus with director strings
- Formalizing strong normalization proofs of explicit substitution calculi in ALF
- Intersection types for explicit substitutions
- On explicit substitution with names
- Call-by-name reduction and cut-elimination in classical logic
- Explicit substitutions and reducibility
- scientific article; zbMATH DE number 2086241 (Why is no real title available?)
- Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
- Strong Normalization of Herbelin's Explicit Substitution Calculus with Substitution Propagation
- Combinatory reduction systems with explicit substitution that preserve strong normalisation
- An abstract factorization theorem for explicit substitutions
- Strong Normalisation of Cut-Elimination That Simulates β-Reduction
- A short proof that adding some permutation rules to \(\beta \) preserves SN
- Resource operators for \(\lambda\)-calculus
This page was built for publication: Explicit substitution. On the edge of strong normalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274458)
