The fine-grain call-by-value -calculus (FGCBV) is a version of the call-by-value -calculus that is useful for studying evaluation order and effects. It was introduced in [Levy, Power, and Thielecke 2003].
Partially inspired by Moggi's computational lambda calculus and call-by-push-value, FGCBV was introduced to resolve certain difficulties in the theory of the CBV -calculus:
All of these problems were resolved by Moggi's monadic metalanguage, by making everything a value, and enclosing computations in monadic terms. However, that does not have clear operational semantics.
FGCBV combines the advantages of the computational -calculus with the monadic metalanguage, as it features aspects of both.
Please expand.
Lassen, Søren Bøgh. 1998. ‘Relational Reasoning about Functions and Nondeterminism’. BRICS Dissertation Series. Aarhus University. https://www.brics.dk/DS/98/2/.
@phdthesis{lassen_1998,
title = {Relational {Reasoning} about {Functions} and {Nondeterminism}},
url = {https://www.brics.dk/DS/98/2/},
school = {Aarhus University},
author = {Lassen, Søren Bøgh},
year = {1998},
note = {Series: BRICS Dissertation Series},
}
Levy, Paul Blain, John Power, and Hayo Thielecke. 2003. ‘Modelling Environments in Call-by-Value Programming Languages’. Information and Computation 185 (2): 182–210. https://doi.org/10.1016/S0890-5401(03)00088-9.
@article{levy_2003,
title = {Modelling environments in call-by-value programming languages},
volume = {185},
doi = {10.1016/S0890-5401(03)00088-9},
number = {2},
journal = {Information and Computation},
author = {Levy, Paul Blain and Power, John and Thielecke, Hayo},
year = {2003},
pages = {182--210}
}