(Enter summary)
Abstract: . Higher-order hereditary Harrop formulas, the underlying logical
foundation of Prolog [NM88], are more expressive than first-order
Horn clauses, the logical foundation of Prolog. In particular, various
forms of scoping and abstraction are supported by the logic of higherorder
hereditary Harrop formulas while they are not supported by firstorder
Horn clauses. Various papers have argued that the scoping and
abstraction available in this richer logic can be used to provide for modular
programming ... (Update)
Active bibliography (related documents): More All
0.6: Higher-Order Logic Programming - Nadathur, Miller (1986)
(Correct)
0.3: Modularity In Logic Programming - Bugliesi, Lamma, Mello (1993)
(Correct)
0.2: Implementation Considerations for Higher-Order Features in.. - Nadathur, Wilson (1993)
(Correct)
Similar documents based on text: More All
0.3: Intuitionistic Implication and Resolution - Hui-Bon-Hoa
(Correct)
0.3: Higher-Order Quantification and Proof Search - Miller (2002)
(Correct)
0.2: Sequent Calculus and the Specification of Computation - Lecture.. - Miller (1997)
(Correct)
BibTeX entry: (Update)
@inproceedings{ miller93proposal,
author = "Dale Miller",
title = "A Proposal for Modules in {$\lambda$Prolog}",
booktitle = "Proceedings of the 4th International Workshop on Extensions to Logic Programming",
publisher = "Springer-Verlag LNAI 798",
editor = "R. Dyckhoff",
year = "1993",
url = "citeseer.ist.psu.edu/miller93proposal.html" }
Citations (may not include all citations):
340
Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991 ACM DBLP
257
Logic programming in a fragment of intuitionistic linear log..
- Hodas, Miller - 1994 ACM DBLP
166
An Overview of Prolog (context) - Nadathur, Miller - 1988
149
A logical analysis of modules in logic programming (context) - Miller - 1989 ACM DBLP
82
Prolog: An extension of Prolog with hypothetical implication.. (context) - Gabbay, Reyle - 1984
60
Contraction-free sequent calculi for intuitionistic logic (context) - Dyckhoff - 1992 DBLP
56
Modularity in logic programming
- Bugliesi, Lamma et al. - 1994 ACM DBLP
55
Clausal intuitionistic logic (context) - McCarty - 1988
53
Lexical scoping as universal quantification
- Miller - 1989 DBLP
36
A theory of modules for logic programming (context) - Miller - 1986 DBLP
27
Abstractions in logic programming (context) - Miller - 1990
20
Abstract syntax and logic programming (context) - Miller - 1992 ACM DBLP
20
Representing objects in a logic programming language with sc..
- Hodas, Miller - 1990 ACM
18
The type system of a higher-order logic programming language
- Nadathur, Pfenning - 1992 ACM DBLP
15
The architecture of an implementation of Prolog: Prolog/Mali (context) - Brisset, Ridoux - 1992
15
Bounds for cut elimination in intuitionistic propositional l.. (context) - Hudelmaier - 1989
14
Clausal intuitionistic logic II (context) - McCarty - 1988
7
Implemented as part of the CMU ERGO project (context) - Elliott, Pfenning et al. - 1989
7
Local definitions with static scope rules in logic languages (context) - Giordano, Martelli et al. - 1988
2
Prolog and Quintus sources (context) - Miller, Nadathur et al. - 1988
Documents on the same site (http://www.cis.upenn.edu/~dale/recentpapers.html): More
Cut-Elimination for a Logic with Definitions and Induction - Raymond McDowell, Dale.. (1997)
(Correct)
A Survey of Linear Logic Programming - Dale Miller (1995)
(Correct)
A Logic Programming Language with Lambda-Abstraction, Function.. - Miller (1991)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC