Abstract machines for Open Call-by-Value

@article{Accattoli2019AbstractMF,
  title={Abstract machines for Open Call-by-Value},
  author={Beniamino Accattoli and Giulio Guerrieri},
  journal={Sci. Comput. Program.},
  year={2019},
  volume={184}
}
Abstract The theory of the call-by-value λ-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages. To model proof assistants, however, strong evaluation and open terms are required. Open call-by-value is the intermediate setting of weak evaluation with (possibly) open terms, on top of which Gregoire and Leroy designed one of the abstract machines of Coq. This paper provides a theory of abstract machines for the fireball calculus… Expand

References

SHOWING 1-10 OF 50 REFERENCES
Implementing Open Call-by-Value
Open Call-by-Value
A Strong Distillery
Crumbling Abstract Machines
The Complexity of Abstract Machines
(In)Efficiency and Reasonable Cost Models
Call-by-Name, Call-by-Value and the lambda-Calculus
  • G. Plotkin
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1975
Types of Fireballs
On Constructor Rewrite Systems and the Lambda-Calculus
...
1
2
3
4
5
...