Substitutions as Logic Programming Specifications Synopsis of a Dissertation Proposal
Download:
|
|
by Chuck Liang
ftp://ftp.cis.upenn.edu/pub/papers/liang/synopsis.ps.Z
Add To MetaCart
Abstract:
This document is a summary of my dissertation proposal, which was presented on September 26th, 1994 at the University of Pennsylvania. My research is being conducted under the advisory of Dale Miller, and uses his work as foundations. This paper is meant as an alternative to reading my full proposal, which is available by anonymous ftp from ftp.cis.upenn.edu, directory pub/papers/liang / (about 90 pages in length). All comments are sincerely welcomed.
Citations
| 635 | A formulation of the simple theory of types – Church - 1940 |
| 572 | A framework for defining logics – Harper, Honsell, et al. - 1993 |
| 186 | Logic programming in the LF logical framework – Pfenning - 1991 |
| 180 | A unification algorithm for typed -calculus – Huet - 1975 |
| 152 | Higher-order logic programming – Miller, Nadathur - 1986 |
| 49 | Unification of simply typed lambda-terms as logic programming – Miller - 1991 |
| 44 | Meta-programming in logic programming – Hill, Gallagher - 1994 |
| 23 | Encoding dependent types in an intuitionistic logic – Felty - 1991 |
| 7 | A declarative alternative to assert in logic programming – Dietzen, Pfenning - 1991 |
| 2 | A logical framework formulation of deductive generalization – Liang - 1994 |
