An environment machine for the λμ-calculus
From MaRDI portal
Publication:4236202
Recommendations
Cited in
(17)- A notation for lambda terms. A generalization of environments
- Classical natural deduction for S4 modal logic
- The \(\lambda \mu^{\mathbf{T}}\)-calculus
- Normalization proofs for the un-typed \(\mu\mu^\prime\)-calculus
- The differential \(\lambda \mu\)-calculus
- The next 700 Krivine machines
- A proof-theoretic foundation of abortive continuations
- A third-order representation of the -calculus
- scientific article; zbMATH DE number 1222571 (Why is no real title available?)
- Classical logic, continuation semantics and abstract machines
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
- An estimation for the lengths of reduction sequences of the \(\lambda\mu\rho\theta\)-calculus
- Programming and Proving with Classical Types
- Normalization in the simply typed -calculus
- A Logical Foundation for Environment Classifiers
- An abstract framework for environment machines
- A syntactic correspondence between context-sensitive calculi and abstract machines
This page was built for publication: An environment machine for the λμ-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4236202)