Axioms for recursion in call-by-value

DOI10.1023/A:1020895213317MaRDI QIDQ1870494zbMATH OpenOpenAlexFDO

Authors Masahito Hasegawa, Yoshihiko Kakutani

Publication date 14 May 2003

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1020895213317

zbMATH Keywords

call-by-valuecategorical semanticscontinuationsiterationrecursion

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• scientific article; zbMATH DE number 1701354
• Axioms for strict and lazy functional programs
• Axiomatics for data refinement in call by value programming languages
• Sound and complete axiomatisations of call-by-value control operators
• Axiomatizing subtyped delimited continuations

Cited in

(6)

• Axioms for strict and lazy functional programs
• On the call-by-value CPS transform and its semantics
• Order-enriched categorical models of the classical sequent calculus
• scientific article; zbMATH DE number 1701354 (Why is no real title available?)
• Relating Computational Effects by ⊤ ⊤-Lifting
• Combining algebraic effects with continuations

This page was built for publication: Axioms for recursion in call-by-value

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