From Mathematics to Abstract Machine: A formal derivation of an executable Krivine machine
Wouter Swierstra
Electronic Proceedings in Theoretical Computer Science · 2012
doi:10.4204/eptcs.76.10 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
This paper presents the derivation of an executable Krivine abstract machine from a small step interpreter for the simply typed lambda calculus in the dependently typed programming language Agda.
Abstract licence: CC BY-NC-ND
References31
31 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.