A Verified Implementation of an Applicative Language with Dynamic Storage Allocation (1993)
Cached
Download Links
- [ftp.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [dirleton.csres.utexas.edu]
- [ftp.cs.utexas.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 18 - 0 self |
BibTeX
@MISC{Flatau93averified,
author = {Arthur D. Flatau},
title = {A Verified Implementation of an Applicative Language with Dynamic Storage Allocation},
year = {1993}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A compiler for a subset of the Nqthm logic and a mechanically checked proof of its correctness is described. The Nqthm logic defines an applicative programming language very similar to McCarthy's pure Lisp[20]. The compiler compiles programs in the Nqthm logic into the Piton assembly level language [23]. The correctness of the compiler is proven by showing that the result of executing the Piton code is the same as produced by the Nqthm interpreter V&C$. The Nqthm logic defines several different abstract data types, or shells, as they are called in Nqthm. The user can also define additional shells. The definition of a shell includes the definition of a constructor function that returns new objects with the type of that shell. These objects can become garbage, so the run-time system of the compiler includes a garbage collector. The proof of the correctness of the compiler has not been entirely mechanically checked. A plan for completing the proof is described.
