Combinatory reduction systems with explicit substitution that preserve strong normalisation
From MaRDI portal
Publication:5055859
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 1130260 (Why is no real title available?)
- scientific article; zbMATH DE number 1499112 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- Combinatory reduction systems: Introduction and survey
- Explicit cyclic substitutions
- Explicit substitutions
- Selected papers on AUTOMATH, dedicated to N. G. de Bruijn
- The Mechanical Evaluation of Expressions
- The lambda calculus. Its syntax and semantics. Rev. ed.
Cited in
(5)- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
- Explicit substitution. On the edge of strong normalization
- Pattern matching as cut elimination
- scientific article; zbMATH DE number 1015107 (Why is no real title available?)
- Comparing and implementing calculi of explicit substitutions with eta-reduction
This page was built for publication: Combinatory reduction systems with explicit substitution that preserve strong normalisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055859)