IMELL cut elimination with linear overhead
From MaRDI portal
Cites work
- (Leftmost-outermost) beta reduction is invariant, indeed
- A calculus for interaction nets based on the linear chemical abstract machine
- A nonstandard standardization theorem
- An abstract factorization theorem for explicit substitutions
- An implementation model of the typed -calculus based on linear chemical abstract machine
- Computational interpretations of linear logic
- Derivational complexity is an invariant cost model
- Distilling abstract machines
- Encoding linear logic with interaction combinators
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
- scientific article; zbMATH DE number 1342283 (Why is no real title available?)
- scientific article; zbMATH DE number 1953273 (Why is no real title available?)
- scientific article; zbMATH DE number 2079018 (Why is no real title available?)
- IMELL cut elimination with linear overhead
- Interaction nets for linear logic
- Local bigraphs and confluence: two conjectures (extended abstract)
- Logical Approaches to Computational Barriers
- On Constructor Rewrite Systems and the Lambda-Calculus
- On the invariance of the unitary cost model for head reduction
- On the Relative Usefulness of Fireballs
- Operational interpretations of linear logic
- Reasonable space for the -calculus, logarithmically
- Strongly reducing variants of the Krivine abstract machine
- The linear abstract machine
- The linear logical abstract machine
- The useful MAM, a reasonable implementation of the strong -calculus
- The weak lambda calculus as a reasonable machine
- Useful Open Call-By-Need
This page was built for publication: IMELL cut elimination with linear overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874986)
