Biorthogonality, Step-Indexing and Compiler Correctness
- Nick Benton ,
- Chung-Kil Hur
Proceedings of the 14th International Conference on Functional Programming (ICFP) |
Published by Association for Computing Machinery, Inc.
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a variant SECD machine. The relations, which are defined using biorthogonality and step indexing, capture what it means for a piece of low-level code to implement a mathematical, domain theoretic function and are used to prove correctness of a simple compiler. The results have been formalized in the Coq proof assistant.
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org. The definitive version of this paper can be found at ACM's Digital Library --http://www.acm.org/dl/.