Gopalan Nadathur, Dale Miller  Home/Search
Context Related
Links: ACM DBLP | uchicago.edu/~gopalan/paper...holp.ps.Z duke.edu/pub/dist/techre...199438.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uchicago.edu/~g...lectureschedule (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ly, if a tactic R holds of G1 and G2, i.e., if (R G1 G2) is solvable from a presentation of primitive tactics as a set of definite clauses, then satisfying the goal G2 in the object-language should suffice to satisfy goal G1. An illustration of these ideas can be provided by considering the task of implementing a proof procedure for propositional Horn clauses. For simplicity of presentation, we restrict the proposi51 type p g. type q g. type r g. type s g. type cl1tac g -? g -? o. type cl2tac... (Update)
Cited by: More
Monadic Concurrent Linear Logic Programming - Lopez, Pfenning, Polakow, Watkins (2005) (Correct)
Extensional Higher-Order Datalog - Kountouriotis, Rondogiannis, Wadge (Correct)
αProlog: A Logic Programming Language with Names.. - Cheney, Urban (Correct)
Active bibliography (related documents): More All
0.6: A Proposal for Modules in λProlog - Miller (1993) (Correct)
0.4: Implementation Considerations for Higher-Order Features in.. - Nadathur, Wilson (1993) (Correct)
0.4: On the Parallel Implementation of the Higher-Order Logic.. - Arcelli, Formato (Correct)
Similar documents based on text: More All
0.6: Scoping Constructs in Logic Programming: Implementation.. - Nadathur, Jayaraman.. (1995) (Correct)
0.5: Uniform Proofs and Disjunctive Logic Programming - Nadathur, Loveland (1995) (Correct)
0.4: The Metalanguage Prolog and Its Implementation - Nadathur (Correct)
Related documents from co-citation: More All
32: Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
25: A logic programming language with lambda-abstraction - Miller - 1991
23: A formulation of the simple theory of types (context) - Church - 1940
BibTeX entry: (Update)
D. Miller and G. Nadathur. Higher-order Logic Programming, LNCS 225: Proceedings of the Third International Logic Programming Conference, Springer-Verlag, ed. Shapiro, pp 448--462, 1986. http://citeseer.ist.psu.edu/article/nadathur86higherorder.html More
@incollection{ nadathurhigherorder,
author = "Gopalan Nadathur and Dale Miller",
title = "Higher-Order Logic Programming",
booktitle = "Handbook of Logic in {AI} and Logic Programming, Volume 5: Logic Programming",
address = "Oxford",
editor = "D. Gabbay and C. Hogger and A. Robinson",
url = "citeseer.ist.psu.edu/article/nadathur86higherorder.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990 ACM
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1981
419 A formulation of the simple theory of types (context) - Church - 1940
343 Principal type schemes for functional programs (context) - Damas, Milner - 1982
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991 ACM DBLP
251 A logic programming language with lambda-abstraction - Miller - 1991
174 A unification algorithm for typed -calculus (context) - Huet - 1975
166 An Overview of Prolog (context) - Nadathur, Miller - 1988
157 Edinburgh LCF: A Mechanised Logic of Computation (context) - Gordon, Milner et al. - 1979
149 A logical analysis of modules in logic programming (context) - Miller - 1989 ACM DBLP
146 Investigations into logical deduction (context) - Gentzen - 1969
145 Isabelle: The next 700 theorem provers (context) - Paulson - 1990
144 Contributions to the theory of logic programming (context) - Apt, van Emden - 1982
121 Proving and applying program transformations expressed with .. (context) - Huet, Lang - 1978
112 The Art of Prolog: Advanced Programming Techniques (context) - Sterling, Shapiro - 1986 ACM
101 HiLog: A foundation for higherorder logic programming - Chen, Kifer et al. - 1993
97 The undecidability of the second-order unification problem (context) - Goldfarb - 1981
86 Completeness in the theory of types (context) - Henkin - 1950 DBLP
81 A multiple-conclusion meta-logic - Miller - 1994 DBLP
69 Higher-order extensions to prolog: Are they needed (context) - Warren - 1982
68 Unification under a mixed prefix (context) - Miller - 1992 ACM DBLP
53 Lexical scoping as universal quantification - Miller - 1989 DBLP
53 Implementing tactics and tacticals in a higher-order logic p.. - Felty - 1993 DBLP
50 Higher-order Horn clauses - Nadathur, Miller - 1990 ACM DBLP
48 From operational semantics to abstract machines (context) - Hannan, Miller - 1992
47 A logic programming approach to manipulating formulas and pr.. - Miller, Nadathur - 1987 ACM DBLP
46 Specifying theorem provers in a higher-order logic programmi.. (context) - Felty, Miller - 1988 ACM DBLP
42 Resolution in type theory (context) - Andrews - 1971 DBLP
31 A semi-functional implementation of a higher-order logic pro.. - Elliott, Pfenning - 1991
31 A Higher-Order Logic as the Basis for Logic Programming - Nadathur - 1987 ACM
29 Proofs and Types (context) - Girard, Taylor et al. - 1989 ACM
27 Abstractions in logic programming (context) - Miller - 1990
27 Automating higher order logic (context) - Andrews, Cohen et al. - 1984
26 Extending definite clause grammars with scoping constructs (context) - Pareschi, Miller - 1990 ACM DBLP
24 Scoping constructs in logic programming: Implementation prob.. - Nadathur, Jayaraman et al. - 1994
21 A mechanization of type theory (context) - Huet - 1973 DBLP
20 On connections and higher-order logic (context) - Andrews - 1989 ACM DBLP
19 The undecidability of unification in third order logic (context) - Huet - 1973 DBLP
18 A proof procedure for the logic of hereditary Harrop formula.. - Nadathur - 1993 ACM DBLP
18 Extended natural semantics (context) - Hannan - 1993 DBLP
18 The type system of a higher-order logic programming language - Nadathur, Pfenning - 1992 ACM DBLP
16 Naive reverse can be linear - Brisset, Ridoux - 1991
15 Implementation considerations for higher-order features in l.. - Nadathur, Jayaraman et al. - 1993 ACM
15 The architecture of an implementation of Prolog: Prolog/Mali (context) - Brisset, Ridoux - 1992
12 A maximal method for set variables in automatic theorem-prov.. (context) - Bledsoe - 1979
11 Implementing polymorphic typing in a logic programming langu.. - Kwon, Nadathur et al. - 1994
5 Higher-order Horn logic programming (context) - Wadge - 1991 DBLP
3 Second-order languages and mathematical practice (context) - Shapiro - 1985 DBLP
2 Prolog and Quintus sources (context) - Miller, Nadathur et al. - 1988
1 A notion of models for higher-order logic (context) - Nadathur - 1994
1 Technical Report Scientific Report No (context) - Gould, procedure et al. - 1976
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uchicago.edu/~gopalan/courses/CS218-318/lectureschedule.html):
Proof Procedures for Logic Programming - Donald W. Loveland, Gopalan.. (1994) (Correct)
A Fine-Grained Notation for Lambda Terms and Its Use in.. - Nadathur (1996) (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