Factorization in call-by-name and call-by-value calculi via linear logic
From MaRDI portal
Publication:2233405
DOI10.1007/978-3-030-71995-1_11OpenAlexW3134025063MaRDI QIDQ2233405FDOQ2233405
Authors: Claudia Faggian, Giulio Guerrieri 
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2101.08364
Cites Work
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Nondeterministic extensions of untyped \(\lambda\)-calculus
- Title not available (Why is that?)
- Linear logic
- The lambda calculus. Its syntax and semantics. Rev. ed.
- A semantic measure of the execution time in linear logic
- The parametric lambda calculus. A metamodel for computation.
- Light affine lambda calculus and polynomial time strong normalization
- On theories with a combinatorial definition of 'equivalence'
- Title not available (Why is that?)
- Term Rewriting and Applications
- The conservation theorem for differential nets
- Parallel reductions in \(\lambda\)-calculus
- Title not available (Why is that?)
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Lambda calculus and intuitionistic linear logic
- Call-by-name, call-by-value, call-by-need and the linear lambda calculus
- An abstract factorization theorem for explicit substitutions
- The bang calculus revisited
- Call-By-Push-Value from a Linear Logic Point of View
- The bang calculus and the two Girard's translations
- Title not available (Why is that?)
- Taylor expansion for Call-By-Push-Value
- Factorization in call-by-name and call-by-value calculi via linear logic
- Leftmost outermost revisited
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)
