The suspension notation for lambda terms and its use in metalanguage implementations
From MaRDI portal
Recommendations
Cites work
- A -calculus with explicit weakening and explicit substitution
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- A notation for lambda terms. A generalization of environments
- A unification algorithm for typed \(\bar\lambda\)-calculus
- Explicit substitutions
- Extending a λ-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms
- Higher order unification via explicit substitutions
- scientific article; zbMATH DE number 2185670 (Why is no real title available?)
- scientific article; zbMATH DE number 2090073 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- The λse-calculus does not preserve strong normalisation
- λν, a calculus of explicit substitutions which preserves strong normalisation
Cited in
(4)
This page was built for publication: The suspension notation for lambda terms and its use in metalanguage implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916200)