A reflection on call-by-value
DOI10.1145/232627.232631zbMATH Open1345.68086OpenAlexW1998873876MaRDI QIDQ2817680FDOQ2817680
Authors: Amr Sabry, Philip Wadler
Publication date: 1 September 2016
Published in: Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/232627.232631
Recommendations
Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18)
Cited In (16)
- A Functional Abstraction of Typed Invocation Contexts
- Relating Functional and Imperative Session Types
- On reduction and normalization in the computational core
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
- Galois connecting call-by-value and call-by-name
- Monadic Translation of Intuitionistic Sequent Calculus
- A Fresh Look at the λ-Calculus
- Kan extensions for program optimisation Or: Art and Dan explain an old trick
- Open call-by-value
- How to prove decidability of equational theories with second-order computation analyser SOL
- Call-by-value is dual to call-by-name
- ANF preserves dependent types up to extensional equality
- Trace-relating compiler correctness and secure compilation
- From call-by-value to interaction by typed closure conversion
- Implementing open call-by-value
- Title not available (Why is that?)
This page was built for publication: A reflection on call-by-value
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817680)