Factorization in call-by-name and call-by-value calculi via linear logic

DOI10.1007/978-3-030-71995-1_11OpenAlexW3134025063MaRDI QIDQ2233405

Giulio Guerrieri, Claudia Faggian

Publication date: 18 October 2021

Full work available at URL: https://arxiv.org/abs/2101.08364

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (3)

Plotkin's call-by-value \(\lambda\)-calculus as a modal calculus ⋮ Factorization in call-by-name and call-by-value calculi via linear logic ⋮ On reduction and normalization in the computational core

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A semantic measure of the execution time in linear logic
• Linear logic
• The parametric lambda calculus. A metamodel for computation.
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Call-by-push-value: Decomposing call-by-value and call-by-name
• Light affine lambda calculus and polynomial time strong normalization
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Lambda calculus and intuitionistic linear logic
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• The bang calculus revisited
• Factorization in call-by-name and call-by-value calculi via linear logic
• Nondeterministic extensions of untyped \(\lambda\)-calculus
• On theories with a combinatorial definition of 'equivalence'
• Call-By-Push-Value from a Linear Logic Point of View
• The conservation theorem for differential nets
• Term Rewriting and Applications
• Taylor expansion for Call-By-Push-Value
• Parallel reductions in \(\lambda\)-calculus

This page was built for publication: Factorization in call-by-name and call-by-value calculi via linear logic