Proving Correctness of Compilers Using Structured Graphs

File Structure

Tree.v, Graph.v: Definition of tree and graph types, respectively.
GraphUnravel.v: Proof of Theorem 2.
Compiler.v: Implementation of the tree-based and the graph-based compiler; proof of Lemma 1 from the paper.
CalculationTactics.v: Tactics for program calculation proofs.
Container.v: Formalisation of containers (used as a representation of strictly positive functors).

To check and compile the complete Coq development, you can use the Makefile:

> make

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
.travis.yml		.travis.yml
Algebra.v		Algebra.v
CalculationTactics.v		CalculationTactics.v
Compiler.v		Compiler.v
Container.v		Container.v
Graph.v		Graph.v
GraphUnravel.v		GraphUnravel.v
Makefile		Makefile
README.md		README.md
Tree.v		Tree.v