Research proof index

The lemma shows that the symbolic compiler (compile) behaves like the concrete evaluator (evaluate) on literal inputs. In particular, let x be an expression, εnv a well-formed symbolic environment for x, and env a well-formed concrete environment for x that is equivalent to εnv. Then, the result produced by the symbolic compiler on x and...

The lemma shows that interpret and compile can be applied in any order to get the same result. In particular, let x be an expression, εnv a well-formed symbolic environment for x, and I a well-formed interpretion for εnv. Then, compiling x with respect to (εnv.interpret I) gives the same result as interpreting the output of compiling x...

Correctness theorem for Opt.compile: Opt.compile produces the same term as SymCC.compile, and Opt.compile produces the same footprint as footprint

Correctness theorem for Opt.compile -- and and or cases

Correctness theorem for Opt.compile -- binaryApp case

Correctness theorem for Opt.compile -- call case