The Machine-Assisted Proof Of Programming Language Properties (1996)
BibTeX
@MISC{Gunter96themachine-assisted,
author = {Carl Gunter and Peter Buneman and Myra Vaninwegen and Myra Vaninwegen and Advisor Carl Gunter},
title = {The Machine-Assisted Proof Of Programming Language Properties},
year = {1996}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The Machine-Assisted Proof of Programming Language Properties Myra VanInwegen Advisor: Carl Gunter The goals of the project described in this thesis are twofold. First, we wanted to demonstrate that if a programming language has a semantics that is complete and rigorous (mathematical), but not too complex, then substantial theorems can be proved about it. Second, we wanted to assess the utility of using an automated theorem prover to aid in such proofs. We chose SML as the language about which to prove theorems: it has a published semantics that is complete and rigorous, and while not exactly simple, is comprehensible. We encoded the semantics of Core SML into the theorem prover HOL (creating new definitional packages for HOL in the process). We proved important theorems about evaluation and about the type system. We also proved the type preservation theorem, which relates evaluation and typing, for a good portion of the language. We were not able to complete the proof of type prese...
