Combinatory reduction systems with explicit substitution that preserve strong normalisation
From MaRDI portal
Publication:5055859
DOI10.1007/3-540-61464-8_51zbMath1503.68089OpenAlexW2126650211MaRDI QIDQ5055859
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61464-8_51
Related Items
Pattern matching as cut elimination ⋮ Comparing and implementing calculi of explicit substitutions with eta-reduction ⋮ Explicit substitution. On the edge of strong normalization ⋮ Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
Uses Software
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Combinatory reduction systems: Introduction and survey
- Selected papers on AUTOMATH, dedicated to N. G. de Bruijn
- Explicit substitutions
- The Mechanical Evaluation of Expressions
- Explicit cyclic substitutions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item