Explicit substitution. On the edge of strong normalization
From MaRDI portal
Recommendations
Cites work
- 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?)
- A note on simplification orderings
- Combinatory reduction systems with explicit substitution that preserve strong normalisation
- Explicit substitutions
- ON STEPWISE EXPLICIT SUBSTITUTION
- \(\lambda\)-calculi with explicit substitutions and composition which preserve \(\beta\)-strong normalization
- λν, a calculus of explicit substitutions which preserves strong normalisation
Cited in
(14)- On explicit substitution with names
- A short proof that adding some permutation rules to \(\beta \) preserves SN
- Explicit substitutions and reducibility
- Lambda-calculus with director strings
- An abstract factorization theorem for explicit substitutions
- scientific article; zbMATH DE number 2086241 (Why is no real title available?)
- Resource operators for \(\lambda\)-calculus
- Strong Normalization of Herbelin's Explicit Substitution Calculus with Substitution Propagation
- Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
- Call-by-name reduction and cut-elimination in classical logic
- Formalizing strong normalization proofs of explicit substitution calculi in ALF
- Combinatory reduction systems with explicit substitution that preserve strong normalisation
- Strong Normalisation of Cut-Elimination That Simulates β-Reduction
- Intersection types for explicit substitutions
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)
