Strong normalization of substitutions

DOI10.1093/logcom/6.6.799zbMath0873.03016OpenAlexW2078737444MaRDI QIDQ2785671

Alejandro Ríos, Thérèse Hardin, Pierre-Louis Curien

Publication date: 26 October 1997

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/6.6.799

zbMATH Keywords

strong normalizationexplicit substitutions\(\lambda\sigma\)-calculuscalculus of substitutionscategorical combinatory logicextended \(\lambda\)-calculustermination of substitution calculi

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Categorical abstract machines for higher-order typed \(\lambda\)-calculi ⋮ Explicit Substitutions à la de Bruijn ⋮ Normalisation for higher-order calculi with explicit substitutions

This page was built for publication: Strong normalization of substitutions