Gopalan Nadathur and Dale Miller. An overview of Prolog. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming: Proceedings of the Fifth International Conference and Symposium, Volume 1, pages 810--827, Cambridge, Massachusetts, August 1988. MIT Press. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Invariant Discovery via Failed Proof Attempts - Jamie Stark And (1998) (4 citations) (Correct)
....to delay choice within the proof. The motivation is that the middle of a proof is typically more constrained than the start. The aim of middle out reasoning is to use the proof to add structure where we do not know what it is. The implementation makes use if the higher order features of prolog [20]. Rippling is used to constrain the matching of wave rules, by taking the annotations into account. Middle out techniques have been used for generalisation [10, 13] logic program synthesis [18] lemma discovery and induction revision [14] 3 A Proof Plan for Invariant Verification exp1: fx = X ....
D. Miller and G. Nadathur. An overview of Prolog. In R. Bowen, K. & Kowalski, editor, Proceedings of the Fifth International Logic Programming Conference/ Fifth Symposium on Logic Programming. MIT Press, 1988.
A Calculus for Higher-order Concurrent Constraint Programming.. - Smolka (1994) (22 citations) (Correct)
....programming is unique in that denotation and equality of variables are captured by first order logic only. In fact, denotation of variables and the facility for higher order programming are completely orthogonal concepts. This is in contrast to existing approaches to higher order logic programming [22, 4]. The paper [24] investigates the relationship between higher order functional computation and higher order relational computation as realized in Calculus B. Chapters 2 4 provide the connection to Logic Programming and motivate and explain the setup of Calculus B. Chapter 5 presents Calculus B ....
Gopalan Nadathur and Dale Miller. An overview of Prolog. In Robert A. Kowalski and Kenneth A. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 810--827, Seattle, Wash., 1988. The MIT Press.
Productive Use of Failure in Inductive Proof - Ireland, Bundy (1995) (45 citations) (Correct)
....of multiple partial proofs. This idea is illustrated in [Ire92] 6 Implementation and results The proof critics presented here have been implemented and tested. Our implementation is an extension of the clam [BvHHS90] proof planning system and exploits the higher order features of Prolog [MN88] Our test results are presented in tables 2, 3 and 4. The proofs of all the example 28 conjectures given in table 2 are discovered completely automatically. These proofs are based only upon definitions supplied by the user. Except for the generalization examples, all additional lemmas are ....
D. Miller and G. Nadathur. An overview of Prolog. In R. Bowen, K. & Kowalski, editor, Proceedings of the Fifth International Logic Programming Conference/ Fifth Symposium on Logic Programming. MIT Press, 1988.
A Pragmatic Reconstruction of λProlog - Belleannée, Brisset, Ridoux (1994) (Correct)
....unsound. It may work when the quantification structure is simple, as in Horn formulas, but it becomes laborious when the quantification structure is as complex as with Harrop formulas. There are other global presentations of Prolog. Miller and Nadathur give a proof theoretic overview of Prolog [46], but it contains very little practical motivations for all the features of Prolog. The presentation of extended natural semantics by Hannan [22] can be seen as a reconstruction of Prolog whose initial motivation is to build specifications via deduction rules. He motivates every feature of ....
G. Nadathur and D.A. Miller. An overview of Prolog. In K. Bowen and R. Kowalski, editors, Symp. Logic Programming, pages 810--827, Seattle, Washington, USA, 1988.
Termination and Confluence of Higher-Order Rewrite Systems - Blanqui (Correct)
.... calculus. In 1991, after Miller s decidability result of the pattern unification problem [20] Nipkow introduced Higher order Rewrite Systems (HRSs) 23] called Pattern Rewrite Systems (PRSs) in [18] to investigate the metatheory of logic programming languages and theorem provers like Prolog [21] or Isabelle [25] In particular, he extended to the higher order case the decidability result of Knuth and Bendix about local confluence of first order term rewrite systems. 1 At the same time, after the works of Breazu Tannen [6] Breazu Tannen and Gallier [7] and Okada [24] on the combination ....
D. Miller and G. Nadathur. An overview of Prolog. In Proc. of the 5th Int. Conf. on Logic Programming, 1988.
A Pragmatic Reconstruction of λProlog - Belleannée, Brisset, Ridoux (1994) (Correct)
....other programming idioms like hypothetical queries (see predicate presumed grandfather in Section 2.2.4) abstract data types, or memoing (see a glimpse of it at the end of Section 5.3) There are other global presentations of Prolog. Miller and Nadathur give a proof theoretic overview of Prolog [48], but it contains little practical motivations for all the features of Prolog. The presentation of extended natural semantics by Hannan [20] can be seen as a reconstruction of Prolog whose initial motivation is to build specifications via deduction rules. He motivates every feature of Prolog by ....
G. Nadathur and D.A. Miller. An overview of Prolog. In K. Bowen and R. Kowalski, editors, Symp. Logic Programming, pages 810--827, Seattle, Washington, USA, 1988.
Avoiding Dynamic Type Checking in a Polymorphic Logic Programming .. - Brisset (Correct)
....of the language must take these types into account. In the latter category, terms are only mapped to types with a have type function. This mapping gives a structure to the model of the program but does not change this model. 1 One of our motivation is to implement a type system for Prolog[16]. Prolog uses a typed logic, i.e. needs types. Therefore we are interested in a prescriptive type system. Even if the motivation is the language Prolog, the ideas we expose in this paper can be applied to the implementation of a polymorphic type system for standard Prolog. Even with a ....
G. Nadathur and D.A. Miller. An overview of Prolog. In K. Bowen and R. Kowalski, editors, Symp. Logic Programming, pages 810--827, Seattle, Washington, USA, 1988.
Maude as a Formal Meta-Tool - Clavel, Durán, Eker.. (1999) (8 citations) (Correct)
....particularly good properties such as conservativity 1 . A number of logics, particularly higher order logics based on typed lambda calculi, have been proposed as logical frameworks, including the Edinburgh logical framework LF [35, 2, 27] generic theorem provers such as Isabelle [56] Prolog [54, 25], and Elf [57] and the work of Basin and Constable [4] on metalogical frameworks. Other approaches, such as Feferman s logical framework FS 0 [24] that has been used in the work of Matthews, Smaill, and Basin [46] earlier work by Smullyan [59] and the 2OBJ generic theorem prover of Goguen, ....
G. Nadathur and D. Miller. An overview of Prolog. In K. Bowen and R. Kowalski, editors, Fifth Int. Joint Conf. and Symp. on Logic Programming, pages 810--827. The MIT Press, 1988.
Using Linear Logic to Reason About Sequent - Systems Dale Miller Self-citation (Miller) (Correct)
No context found.
Gopalan Nadathur and Dale Miller. An Overview of Prolog. In Fifth International Logic Programming Conference, pages 810--827, Seattle, August 1988. MIT Press.
A Proof of the Church-Rosser Theorem - And Its Representation (Correct)
No context found.
Gopalan Nadathur and Dale Miller. An overview of Prolog. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming: Proceedings of the Fifth International Conference and Symposium, Volume 1, pages 810--827, Cambridge, Massachusetts, August 1988. MIT Press.
Linear Higher-Order Pre-Unification - Iliano Cervesato And (Correct)
No context found.
Gopalan Nadathur and Dale Miller. An overview of Prolog. In Kenneth A. Bowen and Robert A. Kowalski, editors, Fifth International Logic Programming Conference, pages 810--827, Seattle, Washington, August 1988. MIT Press. 11
Linear Higher-Order Pre-Unification - Cervesato, Pfenning (1997) (2 citations) (Correct)
No context found.
G. Nadathur and D. Miller. An overview of Prolog. In K. A. Bowen and R. A. Kowalski, editors, Fifth International Logic Programming Conference, pages 810-- 827, Seattle, Washington, Aug. 1988. MIT Press.
Unification and Anti-Unification in the Calculus of.. - Frank Pfenning School (1991) (31 citations) (Correct)
No context found.
Gopalan Nadathur and Dale Miller. An overview of Prolog. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming: Proceedings of the Fifth International Conference and Symposium, Volume 1, pages 810--827, Cambridge, Massachusetts, August 1988. MIT Press.
Unknown - Apport De Recherche (Correct)
No context found.
Gopalan Nadathur and Dale Miller. An overview of Prolog. In Kenneth A. Bowen and Robert A. Kowalski, editors, Fifth International Logic Programming Conference, pages 810827, Seattle, Washington, August 1988. MIT Press.
A Declarative Alternative to - Assert In Logic (Correct)
No context found.
Gopalan Nadathur and Dale Miller. An overview of Prolog. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming: Proceedings of the Fifth International Conference and Symposium, Volume 1, pages 810--827, Cambridge, Massachusetts, August 1988. MIT Press.
Linear Higher-Order Pre-Unification - Iliano Cervesato And (1997) (2 citations) (Correct)
No context found.
Gopalan Nadathur and Dale Miller. An overview of Prolog. In Kenneth A. Bowen and Robert A. Kowalski, editors, Fifth International Logic Programming Conference, pages 810-- 827, Seattle, Washington, August 1988. MIT Press. 55
Natural Semantics and Some of its - Meta-Theory In Elf (Correct)
No context found.
Gopalan Nadathur and Dale Miller. An overview of Prolog. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming: Proceedings of the Fifth International Conference and Symposium, Volume 1, pages 810--827, Cambridge, Massachusetts, August 1988. MIT Press.
A Linear Spine Calculus - Iliano Cervesato And (2003) (1 citation) (Correct)
No context found.
Gopalan Nadathur and Dale Miller. An overview of Prolog. In Kenneth A. Bowen and Robert A. Kowalski, editors, Fifth International Logic Programming Conference, pages 810--827, Seattle, Washington, August 1988. MIT Press.
Unification via Explicit Substitutions: - The Case Of (Correct)
No context found.
Gopalan Nadathur and Dale Miller. An overview of Prolog. In Kenneth A. Bowen and Robert A. Kowalski, editors, Fifth International Logic Programming Conference, pages 810--827, Seattle, Washington, August 1988. MIT Press.
A Proof of the Church-Rosser Theorem and its Representation in a .. - Pfenning (1992) (21 citations) (Correct)
No context found.
Gopalan Nadathur and Dale Miller. An overview of Prolog. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming: Proceedings of the Fifth International Conference and Symposium, Volume 1, pages 810--827, Cambridge, Massachusetts, August 1988. MIT Press.
Higher-Order Narrowing with Convergent - Systems Christian Prehofer (1995) (Correct)
No context found.
Gopalan Nadathur and Dale Miller. An overview of -Prolog. In Robert A. Kowalski and Kenneth A. Bowen, editors, Proc. 5th Int. Logic Programming Conference, pages 810--827. MIT Press, 1988.
Distributed Concurrent Linear Logic Programming - Kobayashi, Shimizu, Yonezawa (9 citations) (Correct)
No context found.
G. Nadathur and D. Miller. An overview of prolog. In Proceedings of the fifth International Conference on Logic Programming, pages 810--827. The MIT Press, 1988.
Electronic Notes in Theoretical Computer Science 4 (1996) - Rewriting Logic As (1998) (1 citation) (Correct)
No context found.
G. Nadathur and D. Miller, An overview of Prolog, in: K. Bowen and R. Kowalski, eds., Fifth Int. Joint Conf. and Symp. on Logic Programming (The MIT Press, 1988) 810--827.
Invariant Discovery via Failed Proof Attempts - Jamie Stark And (1998) (4 citations) (Correct)
No context found.
D. Miller and G. Nadathur. An overview of Prolog. In R. Bowen, K. & Kowalski, editor, Proceedings of the Fifth International Logic Programming Conference/ Fifth Symposium on Logic Programming. MIT Press, 1988.
A Theory of Binding Structures and Applications to Rewriting - Talcott (1991) (21 citations) (Correct)
No context found.
G. Nadathur and D. Miller. An overview of Prolog. In Fifth International Conference on Logic Programming, pages 810--827, 1989.
First 50 documents Next 50
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