Factorization in call-by-name and call-by-value calculi via linear logic
From MaRDI portal
Publication:2233405
Cites work
- scientific article; zbMATH DE number 512773 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 7559284 (Why is no real title available?)
- A semantic measure of the execution time in linear logic
- An abstract factorization theorem for explicit substitutions
- Call-By-Push-Value from a Linear Logic Point of View
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Call-by-name, call-by-value, call-by-need and the linear lambda calculus
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Factorization in call-by-name and call-by-value calculi via linear logic
- Lambda calculus and intuitionistic linear logic
- Leftmost outermost revisited
- Light affine lambda calculus and polynomial time strong normalization
- Linear logic
- Nondeterministic extensions of untyped \(\lambda\)-calculus
- On theories with a combinatorial definition of 'equivalence'
- Parallel reductions in \(\lambda\)-calculus
- Taylor expansion for Call-By-Push-Value
- Term Rewriting and Applications
- The bang calculus and the two Girard's translations
- The bang calculus revisited
- The conservation theorem for differential nets
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The parametric lambda calculus. A metamodel for computation.
Cited in
(4)
This page was built for publication: Factorization in call-by-name and call-by-value calculi via linear logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233405)