Strong normalization of substitutions

DOI10.1007/3-540-55808-X_19zbMath1496.03059OpenAlexW1483430268MaRDI QIDQ5096832

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

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55808-x_19

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (3)

Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract) ⋮ POPLMark reloaded: Mechanizing proofs by logical relations ⋮ Pure type systems with explicit substitutions

Cites Work

• Unnamed Item
• Unnamed Item
• Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL
• Proof of termination of the rewriting system SUBSET on CCL
• Confluence properties of weak and strong calculi of explicit substitutions
• Explicit substitutions

This page was built for publication: Strong normalization of substitutions