Abstract

Abstract: A universally quantified goal can be interpreted intensionally, that is, the goal ∀x.G(x) succeeds if for some new constant c, the goal G(c) succeeds. The constant c is, in a sense, given a scope: it is introduced to solve this goal and is “discharged ” after the goal succeeds or fails. This interpretation is similar to the interpretation of implicational goals: the goal D ⊃ G should succeed if when D is assumed, the goal G succeeds. The assumption D is discharged after G succeeds or fails. An interpreter for a logic programming language containing both universal quantifiers and implications in goals and the body of clauses is described. In its non-deterministic form, this interpreter is sound and complete for intuitionistic logic. Universal quantification can provide lexical scoping of individual, function, and predicate constants. Several examples are presented to show how such scoping can be used to provide a Prolog-like language with facilities data types, and encapsulation of state.

Citations

168	The Art of Prolog: Advanced Programming Techniques - Sterling, Shapiro - 1986
161	Making Prolog more expressive - Lloyd, Topor - 1984
84	An Overview of λProlog - Nadathur, Miller - 1988
79	Partial polymorphic type inference and higher-order unification - Pfenning - 1988
76	U.: N-Prolog: An extension of Prolog with hypothetical implications I - Gabbay, Reyle - 1984
63	Proofs in higher-order logic - Miller - 1983
62	Specifying theorem provers in a higher-order logic programming language - Felty, Miller - 1988
61	A proof-theoretic approach to logic programming. II. Programs as definitions - Hallnäs, Schroeder-Heister - 1991
31	A higher-order logic as the basis for logic programming - Nadathur - 1987
20	A Logical Analysis of Modules - Miller - 1989
16	Clausal intuitionistic logic I. fixed point semantics - McCarty - 1988
14	Uniform Proofs as a Foundation for Logic - MILLER, NADATHUR, et al. - 1991
13	G.: Local Definitions with Static Scope Rules - Giordano, Martelli, et al. - 1988
5	The Foundation of a Generic Theorem Prover - Pauslon - 1989
5	An Overview of - Nadathur, Miller - 1988
3	eLP, a Common Lisp implementation of Prolog - Elliott, Pfenning - 1989
2	eLP, a Common Lisp implementation of λProlog - Elliott, Pfenning - 1989
2	Solutions to λ-Term Equations Under a Mixed Prefix, submitted - Miller - 1989
1	Unification under a mixed prefix (unpublished - Miller - 1988
1	LP2.7, a C-Prolog and Quintus Prolog implementation of Prolog - Miller, Nadathur - 1988
1	A Calculus for the Construction of Modular Prolog - Sannella, Wallen - 1987
1	TEL (Version 0.9), Report and Unser Manula - Smolka - 1987
1	Solutions to -Term Equations Under a Mixed Prefix, submitted - Miller - 1989