From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition (2001)
Cached
Download Links
- [www.cs.indiana.edu]
- [www.cs.uoregon.edu]
- DBLP
Other Repositories/Bibliography
by
Yong Xiao
,
Amr Sabry
,
Zena M. Ariola
| Venue: | Higher-Order and Symbolic Computation |
| Citations: | 11 - 0 self |
BibTeX
@INPROCEEDINGS{Xiao01fromsyntactic,
author = {Yong Xiao and Amr Sabry and Zena M. Ariola},
title = {From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition},
booktitle = {Higher-Order and Symbolic Computation},
year = {2001},
pages = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Developing syntactic theories for reasoning about programming languages usually involves proving a unique-decomposition lemma. The proof of such a lemma is tedious, error-prone, and is usually attempted many times during the design of a theory. We therefore investigate the automation of such proofs.
