A reflection on call-by-value

DOI10.1145/232627.232631zbMath1345.68086OpenAlexW1998873876MaRDI QIDQ2817680

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

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (11)

Trace-Relating Compiler Correctness and Secure Compilation ⋮ Relating Functional and Imperative Session Types ⋮ A Functional Abstraction of Typed Invocation Contexts ⋮ ANF preserves dependent types up to extensional equality ⋮ Open Call-by-Value ⋮ How to prove decidability of equational theories with second-order computation analyser SOL ⋮ Galois connecting call-by-value and call-by-name ⋮ An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form ⋮ A Fresh Look at the λ-Calculus ⋮ Monadic Translation of Intuitionistic Sequent Calculus ⋮ On reduction and normalization in the computational core

This page was built for publication: A reflection on call-by-value