2009 · 120 citations · 24 references
ComputingComputer ScienceCompilersProgramming LanguagesTheory Of ComputationCompiler ConstructionDeductive VerificationPredicate LogicProof AssistantsRecursion TheoryType SystemsAbstract SemanticsCompiler DesignCoqDenotational ModelsFunctional Language DesignLogical Relations
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 stepindexing, 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.
24
LCF considered as a programming language
Gordon Plotkin · Theoretical Computer Science · 1977 · 1.1K citations
The Mechanical Evaluation of Expressions
P. J. Landin · The Computer Journal · 1964 · 932 citations · Full text
Formal certification of a compiler back-end or
Xavier Leroy · 2006 · 652 citations