A logic programming language with lambda-abstraction, function variables, and simple unification (1990)
Cached
Download Links
- [www.lix.polytechnique.fr]
- [www.lix.polytechnique.fr]
- [www.lix.polytechnique.fr]
- [www.lix.polytechnique.fr]
- [ftp.cis.upenn.edu]
- DBLP
Other Repositories/Bibliography
by
Dale Miller
| Venue: | Extensions of Logic Programming. Springer Lecture Notes in Artificial Intelligence |
| Citations: | 271 - 21 self |
BibTeX
@INPROCEEDINGS{Miller90alogic,
author = {Dale Miller},
title = {A logic programming language with lambda-abstraction, function variables, and simple unification},
booktitle = {Extensions of Logic Programming. Springer Lecture Notes in Artificial Intelligence},
year = {1990}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A meta programming language must be able to represent and manipulate such syntactic structures as programs, formulas, types, and proofs. A common characteristic of all these structures is that they involve notions of abstractions, scope, bound and free variables, substitution instances, and equality up to alphabetic changes of bound variables.
