| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422270 | Electronic Notes in Theoretical Computer Science | 2016 | 18 Pages |
Abstract
In this paper we prove the correctness of a compiler for a call-by-name language using step-indexed logical relations and biorthogonality. The source language is an extension of the simply typed lambda-calculus with recursion, and the target language is an extension of the Krivine abstract machine. We formalized the proof in the Coq proof assistant.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Leonardo RodrÃguez, Miguel Pagano, Daniel Fridlender,