A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The Linear Logical Abstract Machine
2006
Electronical Notes in Theoretical Computer Science
We derive an abstract machine from the Curry-Howard correspondence with a sequent calculus presentation of Intuitionistic Propositional Linear Logic. The states of the register based abstract machine comprise a low-level code block, a register bank and a dump holding suspended procedure activations. Transformation of natural deduction proofs into our sequent calculus yields a typepreserving compilation function from the Linear Lambda Calculus to the abstract machine. We prove correctness of the
doi:10.1016/j.entcs.2006.04.007
fatcat:p3qwvmnw4zghjjbdjictiwabk4