(Enter summary)
Abstract: : We present a systematic reconstruction of a compilation method for an
extension to logic programming that permits procedure definitions to be given a scope.
At a logical level, this possibility is realized by permitting implications to be embedded
in goals. Program clauses that appear in the antecedents of such implications may
contain variables that are bound by external quantifiers, leading to non-local variables
in procedure declarations. In compiling programs in this extended language,... (Update)
Active bibliography (related documents): More All
0.3: Modularity In Logic Programming - Bugliesi, Lamma, Mello (1993)
(Correct)
0.3: Efficient Resource Management for Linear Logic Proof Search - Cervesato, al. (1996)
(Correct)
0.2: Implementing a Notion of Modules in the Logic Programming .. - Kwon, Nadathur, Wilson (1993)
(Correct)
Similar documents based on text: More All
0.1: Scoping Constructs in Logic Programming: Implementation.. - Nadathur, Jayaraman.. (1993)
(Correct)
0.1: Implementing Polymorphic Typing in a Logic Programming.. - Kwon, Nadathur, Wilson (1994)
(Correct)
0.1: State Variables And The Affine Nature Of Markovian Hjm Term.. - Chiarella, Kwon
(Correct)
BibTeX entry: (Update)
@article{ kwon97structured,
author = "K. Kwon",
title = "A Structured Presentation of a Closure-Based Compilation Method for a Scoping Notion in Logic Programming",
journal = "J.UCS: Journal of Universal Computer Science",
volume = "3",
number = "4",
pages = "341--??",
year = "1997",
url = "citeseer.ist.psu.edu/kwon97structured.html" }
Citations (may not include all citations):
395
An abstract Prolog instruction set (context) - Warren - 1983
340
Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
257
Logic programming in a fragment of intuitionistic linear log..
- Hodas, Miller - 1994
166
An Overview of Prolog (context) - Nadathur, Miller - 1988
149
A logical analysis of modules in logic programming (context) - Miller - 1989
82
Prolog: An extension of Prolog with hypothetical implication.. (context) - Gabbay, Reyle - 1984
81
A multiple-conclusion meta-logic
- Miller - 1994
55
Clausal intuitionistic logic (context) - McCarty - 1988
48
A logical operational semantics of full Prolog (context) - Borger - 1990
48
A logical operational semantics of full Prolog (context) - Borger - 1990
40
The WAM --- definition and compiler correctness
- Borger, Rosenzweig - 1994
26
Hereditary Harrop formulas and uniform proof systems (context) - Miller, Nadathur et al. - 1987
26
Algebraic operational semantics and Occam
- Gurevich, Moss - 1990
24
Scoping constructs in logic programming: Implementation prob..
- Nadathur, Jayaraman et al. - 1995
19
Bulletin of the European Association for Theoretical Compute.. (context) - Gurevich, introduction - 1991
18
A proof procedure for the logic of hereditary Harrop formula..
- Nadathur - 1993
12
An extended Warren abstract machine for the execution of str.. (context) - Lamma, Mello et al. - 1992
11
Algebraic operational semantics and Modula (context) - Gurevich, Morris - 1988
7
Local definitions with static scope rules in logic languages (context) - Giordano, Martelli et al. - 1988
6
Contextual logic programming (context) - Monteiro, Porto - 1989
4
Towards a Verified Abstract Machine for a Logic Programming .. (context) - Kwon - 1994
1
A Structured Presentation of a Closure-Based Compilation Met.. (context) - McCarty, logic et al. - 1988
1
A Smalltalk Evolving Algberas and Its Uses (context) - Blakley - 1992
Documents on the same site (http://linux.eecs.umich.edu/groups/Ealgebras/): More
Montages Specifications of Realistic Programming Languages - Kutter, Pierantonio (1997)
(Correct)
Refinement of a typed WAM extension by polymorphic.. - Beierle, Börger (1996)
(Correct)
Sequential Asm Thesis - Gurevich (1999)
(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