Call-by-value solvability, revisited

DOI10.1007/978-3-642-29822-6_4MaRDI QIDQ2900255zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Beniamino Accattoli, Luca Paolini

Publication date 20 July 2012

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-00780358/file/FLOPS2012.pdf

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Call-by-value Solvability
• A Semantical and Operational Account of Call-by-Value Solvability
• No solvable lambda-value term left behind
• Standardization of a Call-By-Value Lambda-Calculus
• scientific article; zbMATH DE number 6825409

Cited in

(34)

• System \(T\), call-by-value and the minimum problem
• Game-theoretic analysis of call-by-value computation
• The bang calculus revisited
• Implementing open call-by-value
• A relational account of call-by-value sequentiality
• Open call-by-value
• A mechanism of function calls in MSVL
• scientific article; zbMATH DE number 177801 (Why is no real title available?)
• scientific article; zbMATH DE number 1948165 (Why is no real title available?)
• scientific article; zbMATH DE number 2044494 (Why is no real title available?)
• Call-by-value Solvability
• The Negligible and Yet Subtle Cost of Pattern Matching
• Towards a semantic measure of the execution time in call-by-value lambda-calculus
• A Fresh Look at the λ-Calculus
• scientific article; zbMATH DE number 7204428 (Why is no real title available?)
• Head reduction and normalization in a call-by-value lambda-calculus
• A Semantical and Operational Account of Call-by-Value Solvability
• On reduction and normalization in the computational core
• The bang calculus revisited
• Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
• Solvability for generalized applications
• Strong call-by-value and multi types
• Light genericity
• Exponentials as substitutions and the cost of cut elimination in linear logic
• Positive focusing is directly useful
• A fresh inductive approach to useful call-by-value
• Mirroring call-by-need, or values acting silly
• Meaningfulness and genericity in a subsuming framework (invited talk)
• Sharing and linear logic with restricted access
• Genericity through stratification
• The benefits of diligence
• Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space
• Mirroring call-by-need, or values acting silly
• Proof nets and the call-by-value \(\lambda\)-calculus

This page was built for publication: Call-by-value solvability, revisited

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