(Enter summary)
Abstract: : First-order Horn clause logic can be extended to a higher-order setting in which function and predicate symbols can be variables and terms are replaced with simply typed -terms. For such a logic programming language to be complete in principle, it must incorporate higher-order unification. Although higher-order unification is more complex than usual first-order unification, its availability makes writing certain kinds of programs far more straightforward. In this paper, we present such... (Update)
Context of citations to this paper: More
...unification like a Prolog interpreter. An example of such an implementation, as a metainterpreter on top of Lambda Prolog, is given in [9]. Observe however that an important difference of such a theorem prover from a standard Prolog interpreter is in the wider distribution of...
Cited by: More
Higher-Order Horn Clauses - Gopalan Nadathur Duke (1990)
(Correct)
Encoding Generic Judgments - Dale Miller Computer (2001)
(Correct)
Automating Functional Program Transformation - Mottl (2000)
(Correct)
Active bibliography (related documents): More All
0.1: Higher-Order Logic as the Basis for Logic Programming - Nadathur (1989)
(Correct)
0.1: UNIFORM PROOFS AS A FOUNDATION FOR LOGIC PROGRAMMING Dale Miller - Computer And (1989)
(Correct)
0.1: On the Parallel Implementation of the Higher-Order Logic.. - Arcelli, Formato
(Correct)
Similar documents based on text: More All
0.7: Some Uses of Higher-Order Logic - In Computational Linguistics
(Correct)
0.4: Logic in topoi: Functorial Semantics for Higher-Order Logic - Awodey (1997)
(Correct)
0.3: The Metalanguage Prolog and Its Implementation - Nadathur
(Correct)
Related documents from co-citation: More All
20: An unification algorithm for typed -calculus (context) - Huet - 1975
18: An overview of prolog (context) - Nadathur, Miller - 1988
18: Higher-order abstract syntax (context) - Pfenning, Elliott - 1988
BibTeX entry: (Update)
Dale Miller and Gopalan Nadathur. A logic programming approach to manipulating formulas and programs. In Seif Haridi, editor, IEEE Symposium on Logic Programming, pages 379--388, San Francisco, September 1987. http://citeseer.ist.psu.edu/article/miller94logic.html More
@inproceedings{ miller87logic,
author = "D. Miller and G. Nadathur",
title = "A Logic Programming Approach to Manipulating Formulas and Programs",
booktitle = "Proceedings of the Fifth International Conference and Symposium on Logic Programming",
month = "August - September",
publisher = "Computer Society Press",
address = "San Francisco",
pages = "379-388",
year = "1987",
url = "citeseer.ist.psu.edu/article/miller94logic.html" }
Citations (may not include all citations):
363
Programming in Prolog (context) - Clocksin, Mellish - 1981
174
A Unification Algorithm for Typed -Calculus (context) - Huet - 1975
146
Investigations into Logical Deductions (context) - Gentzen - 1969
121
Proving and Applying Program Transformations Expressed with .. (context) - Huet, Lang - 1978 DBLP
69
Higher-order extension to PROLOG: are they needed (context) - Warren - 1982
39
Springer Verlag (context) - Gordon, Milner et al. - 1979
39
Natural Deduction as Higher-Order Resolution
- Paulson - 1986 ACM DBLP
39
A System which Automatically Improves Programs (context) - Darlington, Burstall - 1973 DBLP
36
A Theory of Modules for Logic Programming (context) - Miller - 1986 DBLP
31
A Higher-Order Logic as the Basis for Logic Programming
- Nadathur - 1987 ACM
18
Some Uses of Higher-Order Logic in Computational Linguistics
- Miller, Nadathur - 1986 ACM
1
and U. Reyle, "N-Prolog: An Extension to Prolog with Hypothe.. (context) - Gabbay - 1984
The graph only includes citing articles where the year of publication is known.
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