Based on constructive type theory, we study two idealized imperative languages GC and IC and verify the correctness of a compiler from GC to IC. GC is a guarded command language with underspecified execution order defined with an axiomatic semantics. IC is a deterministic low-level language with linear sequential composition and lexically scoped gotos defined with a small-step semantics. We characterize IC with an axiomatic semantics and prove that the compiler from GC to IC preserves specifications. The axiomatic semantics we consider model total correctness and map programs to continuous predicate transformers. We define the axiomatic semantics of GC and IC with elementary inductive predicates and show that the predicate transformer described by a program can be obtained compositionally by recursion on the syntax of the program using a fixed point operator for loops and continuations. We also show that two IC programs are contextually equivalent if and only if their predicate transformers are equivalent.

Browse Online: (proofs visible) (proofs hidden)

- Basic facts about predicates and fixed points: (proofs visible) (proofs hidden)
- Abstract state structures: (proofs visible) (proofs hidden)
- Guarded Commands
- Syntax: (proofs visible) (proofs hidden)
- Semantics: (proofs visible) (proofs hidden)
- Continuity: (proofs visible) (proofs hidden)

- Imperative Continuations
- Syntax: (proofs visible) (proofs hidden)
- Semantics: (proofs visible) (proofs hidden)
- Continuity: (proofs visible (proofs hidden)
- Equivalence: (proofs visible) (proofs hidden)

- Compiler from GC to IC: (proofs visible) (proofs hidden)