Call-by-push-value

<p>In <a href="/facts/Programming_language_theory/MfecfTFI">programming language theory</a>, call-by-push-value (CBPV) is an <a href="/facts/Intermediate_language/s0qRrbfh">intermediate language</a> that embeds the <a href="/facts/Call-by-value/Pc9kLWgs">call-by-value</a> (CBV) and <a href="/facts/Call-by-name/Pc9kLWgs">call-by-name</a> (CBN) <a href="/facts/Evaluation_strategy/Pc9kLWgs">evaluation strategies</a>. CBPV is structured as a polarized <a href="/facts/%25CE%259B-calculus/DaD3RuQ4">λ-calculus</a> with two main types, "values" (+) and "computations" (-). Restrictions on interactions between the two types enforce a controlled order of evaluation, similar to <a href="/facts/Monad_(functional_programming)/kYazRoF1">monads</a> or <a href="/facts/Continuation_passing_style/lW296oxe">CPS</a>. The calculus can embed computational effects, such as nontermination, mutable state, or nondeterminism. There are natural semantics-preserving translations from CBV and CBN into CBPV. This means that giving a CBPV semantics and proving its properties implicitly establishes CBV and CBN semantics and properties as well. Paul Blain Levy formulated and developed CBPV in several papers and his doctoral thesis.
</p>

Call-by-push-value open-in-new

Call-by-push-value