(Enter summary)
Abstract: In this article, we discuss several possible extensions to traditional logic programming languages.
The specic extensions proposed here fall into two categories: logical extensions and the
addition of constructs to allow for increased control. There is a unifying theme to the proposed
logical extensions, which is the scoped introduction of extensions to a programming context.
More specically these extensions are the ability to introduce variables whose scope is limited
to the term in... (Update)
Context of citations to this paper: More
...program. Furthermore, the visibility of predicate symbols should be restricted. 2. 3 Modules The notion of modules as introduced in [5, 6, 10] provide the information hiding properties that are needed for our purposes. A module consists of a declaration part or signature and a...
Cited by: More
Representing Objects as Modules in Deductive Databases - Freitag (1994)
(Correct)
Active bibliography (related documents): More All
0.1: Specifying and Debugging Security Protocols in the hhf Fragment.. - Delzanno (2000)
(Correct)
0.1: Specifying and Debugging Security Protocols in the hhf Fragment.. - Delzanno (2000)
(Correct)
0.1: A Model for Declarative Programming and Specification with.. - Caires (1999)
(Correct)
Similar documents based on text: More All
0.3: Temporal Logic Extended by Universal Quantifiers - Maidl
(Correct)
0.2: Generating Descriptions Containing Quantifiers: Aggregation and .. - van Deemter
(Correct)
0.0: Studying the ML Module System in HOL - Gunter, Maharaj (1994)
(Correct)
BibTeX entry: (Update)
E. L. Gunter. Extensions to logic programming motivated by the construction of a generic theorem prover. In [12], pages 223--244. 1991. http://citeseer.ist.psu.edu/gunter91extensions.html More
@inproceedings{ gunter89extensions,
author = "Elsa L. Gunter",
title = "Extensions to Logic Programming Motivated by the Construction of a Generic Theorem Prover",
booktitle = "Proceedings of the International Workshop on Extensions of Logic Programming",
publisher = "Springer-Verlag LNAI 475",
address = "T{\"u}bingen, Germany",
editor = "Peter Schroeder-Heister",
pages = "223--244",
year = "1989",
url = "citeseer.ist.psu.edu/gunter91extensions.html" }
Citations (may not include all citations):
363
Programming in Prolog (context) - Clocksin, Mellish - 1987 ACM
340
Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. ACM DBLP
149
A logical analysis of modules in logic programming (context) - Miller - 1989 ACM DBLP
129
The foundation of a generic theorem prover
- Paulson - 1989 ACM DBLP
103
The Denition of Standard ML (context) - Milner, Tofte et al. - 1990
54
Specifying and Implementing Theorem Provers in a Higher-Orde.. (context) - Felty - 1989 ACM
47
A logic programming approach to manipulating formulas and pr..
- Miller, Nadathur - 1987 ACM DBLP
46
Specifying theorem prover in a higher-order logic programmin.. (context) - Felty, Miller - 1988
6
Lexical scoping as universal quantication (context) - Miller - 1989
1
The construction and use of a generic theorem prover in -pr.. (context) - Gunter - 1990
Documents on the same site (http://cm.bell-labs.com/who/elsa/papers/bib.html): More
Pseudo-Retract Functors for Local Lattices and Bifinte L-Domains - Gunter
(Correct)
Adding External Decision Procedures to HOL90 Securely - Elsa Gunter Bell (1998)
(Correct)
Interfacing HOL90 with a Functional Database Query Language - Gunter, Libkin (1995)
(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