University of Cambridge > > Semantics Lunch (Computer Laboratory) > Biorthogonality, step-indexing and compiler correctness

Biorthogonality, step-indexing and compiler correctness

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Sam Staton.

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.

This is joint work with Nick Benton.

This talk is part of the Semantics Lunch (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity