(Enter summary)
Abstract: Introducing types into a logic programming language leads to the need for typed unification
within the computation model. In the presence of polymorphism and higher-order features,
this aspect forces analysis of types at run-time. We propose extensions to the Warren Abstract
Machine (WAM) that permit such analysis to be done with reasonable efficiency. Much information
about the structures of types is present at compile-time, and we show that this information
can be used to considerably reduce... (Update)
Context of citations to this paper: More
.... this respect, other work that we have done concerning the treatment of implications and universal quantifiers in goals [19, 29] and types [21]. The higher order additions that we consider here allow for a quantification over predicate and function variables and for the use of...
...as well. We have studied the implementation issues arising out the other extensions in recent work and have detailed solutions to them [7, 17, 18]. We outline the nature of these solutions here but do not present them in detail. In a broad sense, our solutions to the other...
Cited by: More
A Treatment of Higher-Order Features in Logic Programming - Nadathur (2003)
(Correct)
Implementation Considerations for Higher-Order Features in.. - Jayaraman, Wilson
(Correct)
The Metalanguage Prolog and Its Implementation - Nadathur
(Correct)
Similar documents (at the sentence level):
65.6%: Implementing Polymorphic Typing in a Logic Programming.. - Kwon, Nadathur, Wilson (1993)
(Correct)
Active bibliography (related documents): More All
0.3: The Architecture of an Implementation of λProlog.. - Brisset, Ridoux (1995)
(Correct)
0.3: Scoping Constructs in Logic Programming: Implementation.. - Nadathur, Jayaraman.. (1993)
(Correct)
0.3: The Compilation of Prolog and its Execution with MALI - Brisset, Ridoux (1993)
(Correct)
Similar documents based on text: More All
0.7: Implementing a Notion of Modules in the Logic Programming .. - Kwon, Nadathur, Wilson (1993)
(Correct)
0.4: A Notation for Lambda Terms I: A Generalization of Environments - Nadathur, Wilson (1994)
(Correct)
0.3: A Notation for Lambda Terms: A Generalization of Environments - Nadathur, Wilson (1994)
(Correct)
Related documents from co-citation: More All
8: An abstract prolog instruction set (context) - Warren - 1983
7: Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
7: Scoping constructs in logic programming: Implementation problems and their solut..
- Nadathur, Jayaraman et al. - 1995
BibTeX entry: (Update)
Keehang Kwon, Gopalan Nadathur, and Debra Sue Wilson. Implementing polymorphic typing in a logic programming language. Computer Languages, 20(1):25--42, 1994. http://citeseer.ist.psu.edu/article/kwon94implementing.html More
@techreport{ kwon93implementing,
author = "Keehang {Kwon} and Gopalan {Nadathur} and Debra Sue Wilson.",
title = "Implementing Polymorphic Typing in a Logic Programming Language",
number = "Technical report DUKE--TR--1993--24",
year = "1993",
url = "citeseer.ist.psu.edu/article/kwon94implementing.html" }
Citations (may not include all citations):
395
An abstract Prolog instruction set (context) - Warren - 1983
248
The semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976
166
An Overview of Prolog (context) - Nadathur, Miller - 1988
157
Edinburgh LCF: A Mechanised Logic of Computation (context) - Gordon, Milner et al. - 1979
125
Warren's Abstract Machine: A Tutorial Reconstruction (context) - Ait-Kaci - 1991
109
A polymorphic type system for Prolog (context) - Mycroft, O'Keefe - 1984
54
Specifying and Implementing Theorem Provers in a Higher-Orde.. (context) - Felty - 1989
54
Partial polymorphic type inference and higher-order unificat.. (context) - Pfenning - 1988
47
A logic programming approach to manipulating formulas and pr..
- Miller, Nadathur - 1987
43
Typed Prolog: A semantic reconstruction of the MycroftO 'Kee.. (context) - Lakshman, Reddy - 1991
38
A representation of lambda terms suitable for operations on .. (context) - Nadathur, Wilson - 1990
31
Horn clause programs with polymorphic types: Semantics and r.. (context) - Hanus - 1989
25
Investigating a Proof-Theoretic Meta-Language for Functional.. (context) - Hannan - 1990
24
Scoping constructs in logic programming: Implementation prob..
- Nadathur, Jayaraman et al. - 1993
18
The type system of a higher-order logic programming language
- Nadathur, Pfenning - 1992
18
Towards a WAM model for Prolog (context) - Nadathur, Jayaraman - 1989
16
Implementation techniques for scoping constructs in logic pr.. (context) - Jayaraman, Nadathur - 1991
15
Implementation considerations for higher-order features in l..
- Nadathur, Jayaraman et al. - 1993
13
Polymorphic higher-order programming in Prolog (context) - Hanus - 1989
11
Higher-order and modal logic as a framework for explanation-.. (context) - Dietzen, Pfenning - 1992
11
Register allocation in a Prolog machine
- Debray - 1986
10
Implementing logic programming languages with polymorphic ty.. (context) - Kwon, Nadathur et al. - 1991
9
Extending the Warren abstract machine to polymorphic order-s.. (context) - Beierle, Meyer et al. - 1991
9
Notions of polymorphism for predicate logic programs (context) - Reddy - 1988
5
An instruction set for higher-order hereditary Harrop formul.. (context) - Kwon, Nadathur - 1992
4
Technical Report SEKI-Report SR (context) - Smolka, Version et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.duke.edu.html): More
Band Ordering in Lossless Compression of Multispectral Images - Tate (1994)
(Correct)
A Notation for Lambda Terms II: Refinements and Applications - Nadathur (1994)
(Correct)
I/O-Efficient Scientific Computation Using TPIE - Vengroff, Vitter (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