1 problem
- 0 votes0 replies0 views
The syntax-and-semantics refinement conjecture for call-by-value lambda-calculus
The paper studies a call-by-value setting in which execution time is measured by the number of -steps leading to a normal form, if any, using a relational denotational s…