Strong call-by-value and multi types

DOI10.1007/978-3-031-47963-2_13MaRDI QIDQ6605354zbMATH OpenFDO

Authors Beniamino Accattoli, Giulio Guerrieri, Maico Leberle

Publication date 13 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-47963-2_13

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A compiled implementation of strong reduction
• A semantic measure of the execution time in linear logic
• A Semantical and Operational Account of Call-by-Value Solvability
• An abstract machine for strong call by value
• An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
• 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-value non-determinism in a linear logic type discipline
• Call-by-value Solvability
• Call-by-value solvability, revisited
• Call-by-Value  -calculus and LJQ
• Collapsing non-idempotent intersection types
• Execution time of λ-terms via denotational semantics and intersection types
• scientific article; zbMATH DE number 4179333 (Why is no real title available?)
• scientific article; zbMATH DE number 482822 (Why is no real title available?)
• scientific article; zbMATH DE number 2044494 (Why is no real title available?)
• scientific article; zbMATH DE number 6825409 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• Linear logic
• Modelling environments in call-by-value programming languages.
• Non-idempotent intersection types for the lambda-calculus
• On the Relative Usefulness of Fireballs
• On the value of variables
• Open call-by-value
• Proof nets and the call-by-value \(\lambda\)-calculus
• Quantitative types for the linear substitution calculus
• The duality of computation
• The parametric lambda calculus. A metamodel for computation.
• The weak lambda calculus as a reasonable machine
• Tight typings and split bounds, fully developed
• Towards a semantic measure of the execution time in call-by-value lambda-calculus
• Types by need
• Types of fireballs

Cited in

(3)

• Light genericity
• A quantitative approach to global state composition
• Genericity through stratification

This page was built for publication: Strong call-by-value and multi types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6605354)