Dale Miller  Home/Search
Context Related
| upenn.edu/pub/papers/miller...iclp89.ps 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: upenn.edu/pub/pape...recentpapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: : A universally quantified goal can be interpreted intensionally, that is, the goal 8x: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 oe G should succeed if when D is assumed, the goal G succeeds. The assumption D is discharged after G succeeds or fails.... (Update)
Context of citations to this paper: More
...applications to this particular domain of computer science. The proof search paradigm comes equipped with notions of abstract data types [22] and higher order predicate abstractions [28] all features that we shall draw upon in this paper. Given that these abstraction mechanism...
.... [15] nonces in security protocols [1] reference locations in imperative programming [2, 16] and constructors hidden within abstract data types [12]. Eigenvariables also provide an essential : y : B[y=x] C : r x:B; C rL : y : B[y=x]...
Cited by: More
Appears in Annals of Pure and Applied Logic, 107(1), pp.. - Focussing And Proof (2000) (Correct)
A Logical Framework For Reasoning About Logical Specifications - Tiu (2004) (Correct)
A Modal Extension of Logic Programming: Modularity.. - Baldoni, Giordano.. (1998) (Correct)
Active bibliography (related documents): More All
0.5: A Deductive Database Language Supporting Modules - Freitag (1992) (Correct)
0.4: Proof Procedures for Logic Programming - Donald W. Loveland, Gopalan.. (1994) (Correct)
0.3: Implementing Tactics and Tacticals in a Higher-Order Logic.. - Amy Felty (1993) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.2: Representing Objects in a Logic Programming Language with.. - Hodas, Miller (1990) (Correct)
0.1: Design and Evaluation of Router-Supported and End-to-End.. - Mostafa (1999) (Correct)
0.1: Scoping Constructs for Software Generators - Smaragdakis, Batory (Correct)
Related documents from co-citation: More All
35: Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
32: Miller D.: A Logical Analysis of Modules in Logic Programming, Journal of Logic Programming, 1989, pp. 79 19
30: Logic programming in a fragment of intuitionistic linear logic - Hodas, Miller - 1994
BibTeX entry: (Update)
D.A. Miller. Lexical scoping as universal quantification. In G. Levi and M. Martelli, editors, 6th Int. Conf. Logic Programming, pages 268--283, MIT Press, 1989. http://citeseer.ist.psu.edu/miller89lexical.html More
@inproceedings{ miller89lexical,
author = "Miller, D.",
title = "Lexical Scoping as Universal Quantification",
booktitle = "Proceedings of the Sixth International Conference on Logic Programming",
publisher = "The MIT Press",
address = "Lisbon",
editor = "Levi, Giorgio and Martelli, Maurizio",
pages = "268--283",
year = "1989",
url = "citeseer.ist.psu.edu/miller89lexical.html" }
Citations (may not include all citations):340 Uniform Proofs as a Foundations for Logic Programming (context) - Miller, Nadathur et al.
149 A Logical Analysis of Modules in Logic Programming (context) - Miller - 1989
112 The art of Prolog: advanced programming techniques (context) - Sterling, Shapiro - 1986
105 Making Prolog More Expressive (context) - Lloyd, Topor - 1984
101 Higher-order Logic Programming - Miller, Nadathur - 1986
68 Unification under a mixed prefix (context) - Miller - 1988
58 Contextual Logic Programming (context) - Monteiro, Porto - 1989
55 Clausal Intuitionistic Logic (context) - McCarty - 1988
39 A Proof-Theoretic Approach to Logic Programming (context) - Hallnas, Schroeder-Heister
31 A Higher-Order Logic as the Basis for Logic Programming - Nadathur - 1987
30 A Calculus for the Construction of Modular Prolog Programs (context) - Sannella, Wallen - 1987
14 SEKI Report SR (context) - Smolka, Version et al. - 1987
14 Clausal Intuitionistic Logic II (context) - McCarty - 1988
6 Local Definitions with Static Scope Rules in Logic Programmi.. (context) - Giordano, Martelli et al. - 1988
3 Prolog: An Extension to Prolog with Hypothetical Implication.. (context) - Gabbay, Reyle - 1984
3 Fifth International Conference on Logic Programming (context) - Nadathur, Miller et al. - 1988
3 a Common Lisp implementation of Prolog (context) - Elliott, Pfenning - 1989
3 Solutions to -term equations under a mixed prefix (context) - Miller - 1989
1 Prolog and Quintus Prolog implementation of Prolog (context) - Miller, Nadathur et al. - 1988
1 The Foundation of a Generic Theorem Prover (context) - Pauslon
The graph only includes citing articles where the year of publication is known.
Documents on the same site (ftp://ftp.cis.upenn.edu/pub/papers/miller/recentpapers.html): More
Some Uses of Higher-Order Logic in Computational Linguistics - Miller, Nadathur (1986) (Correct)
Foundational Aspects of Syntax - Miller, Palamidessi (1999) (Correct)
Linear Logic As A Framework For Specifying Sequent Calculus - Miller, PIMENTEL (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