Gopalan Nadathur, Debra Sue Wilson  Home/Search
Context Related
Links: ACM | duke.edu/pub/dist/techr...199316.ps.gz 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: duke.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper examines implementation problems that arise from providing for aspects of higher-order programming within and enhancing the metalanguage abilities of logic programming. One issue of concern is a representation for the simply-typed lambda terms that replace the usual first-order terms as data structures; this representation must support an efficient realization of -conversion operations on these terms. Another issue is the handling of higher-order unification that becomes an integral... (Update)
Context of citations to this paper: More
.... Several approaches have been proposed for providing good implementations of the language [Brisset 93, Elliot 91, Jayaraman 91, Nadathur 92] One of the major tasks in this regard is to find a satisfactory representation for terms, to enable an easy examination of the...
...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
Optimizing Higher-Order Pattern Unification - Pientka, Pfenning (2003) (Correct)
Implementing Polymorphic Typing in a Logic Programming.. - Kwon, Nadathur, Wilson (1993) (Correct)
A Notation for Lambda Terms I: A Generalization of Environments - Nadathur, Wilson (1994) (Correct)
Similar documents (at the sentence level):
61.0%: Implementation Considerations for Higher-Order Features in.. - Jayaraman, Wilson (Correct)
Active bibliography (related documents): More All
0.7: A Treatment of Higher-Order Features in Logic Programming - Nadathur (2003) (Correct)
0.6: A Proof Procedure for the Logic of Hereditary Harrop Formulas - Nadathur (1993) (Correct)
0.6: Scoping Constructs in Logic Programming: Implementation.. - Nadathur, Jayaraman.. (1993) (Correct)
Similar documents based on text: More All
0.5: The Suspension Notation for Lambda Terms and its Use in.. - Nadathur (2003) (Correct)
0.5: The Metalanguage Prolog and Its Implementation - Nadathur (Correct)
0.4: Tradeoffs in the Intensional Representation of Lambda Terms - Liang, Nadathur (Correct)
Related documents from co-citation: More All
9: An unification algorithm for typed -calculus (context) - Huet - 1975
8: An overview of prolog (context) - Nadathur, Miller - 1988
8: A logic programming approach to manipulating formulas and programs - Miller, Nadathur - 1987
BibTeX entry: (Update)
Gopalan Nadathur, Bharat Jayaraman, and Debra Sue Wilson. Implementation considerations for higher-order features in logic programming. Technical Report CS-1993-16, Department of Computer Science, Duke University, June 1993. http://citeseer.ist.psu.edu/nadathur93implementation.html More
@techreport{ nadathur93implementation,
author = "Gopalan {Nadathur} and Bharat {Jayaramn} and Debra Sue Wilson.",
title = "Implementation Considerations for Higher-Order Features in Logic Programming",
number = "DUKE--TR--1993--16",
year = "1993",
url = "citeseer.ist.psu.edu/nadathur93implementation.html" }
Citations (may not include all citations):419 A formulation of the simple theory of types (context) - Church - 1940 DBLP
395 An abstract Prolog instruction set (context) - Warren - 1983
363 Programming in Prolog (context) - Clocksin, Mellish - 1984 ACM
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
251 A logic programming language with lambda-abstraction - Miller - 1991
174 A unification algorithm for typed -calculus (context) - Huet - 1975
172 Higher-order abstract syntax (context) - Pfenning, Elliot - 1988 ACM DBLP
166 An Overview of Prolog (context) - Nadathur, Miller - 1988
144 Contributions to the theory of logic programming (context) - Apt, van Emden - 1982 ACM DBLP
125 Warren's Abstract Machine: A Tutorial Reconstruction (context) - Ait-Kaci - 1991
121 Proving and applying program transformations expressed with .. (context) - Huet, Lang - 1978 DBLP
106 The categorical abstract machine (context) - Cousineau, Curien et al. - 1987 ACM DBLP
101 Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
54 Specifying and Implementing Theorem Provers in a Higher-Orde.. (context) - Felty - 1989 ACM
54 Partial polymorphic type inference and higher-order unificat.. (context) - Pfenning - 1988
50 Higher-order Horn clauses - Nadathur, Miller - 1990 ACM DBLP
47 A logic programming approach to manipulating formulas and pr.. - Miller, Nadathur - 1987 ACM DBLP
46 Specifying theorem provers in a higher-order logic programmi.. (context) - Felty, Miller - 1988 ACM DBLP
42 On laziness and optimality in lambda interpreters: Tools for.. (context) - Field - 1990 ACM DBLP
38 A representation of lambda terms suitable for operations on .. (context) - Nadathur, Wilson - 1990 ACM DBLP
31 A semi-functional implementation of a higher-order logic pro.. - Elliott, Pfenning - 1991
31 A notation for lambda terms I: A generalization of environme.. - Nadathur, Wilson - 1993
28 and Jean-Jacques L'evy (context) - Abadi, Cardelli et al. - 1990
25 Investigating a Proof-Theoretic Meta-Language for Functional.. (context) - Hannan - 1990 ACM
25 An empirical study of the runtime behavior of higherorder lo.. - Michaylov, Pfenning - 1992
24 Scoping constructs in logic programming: Implementation prob.. - Nadathur, Jayaraman et al. - 1993
18 Some uses of higher-order logic in computational linguistics - Miller, Nadathur - 1986 ACM
18 The type system of a higher-order logic programming language - Nadathur, Pfenning - 1992 ACM DBLP
18 Uses of higher-order unification for implementing program tr.. (context) - Hannan, Miller - 1988 DBLP
16 Naive reverse can be linear - Brisset, Ridoux - 1991
16 Implementation techniques for scoping constructs in logic pr.. (context) - Jayaraman, Nadathur - 1991 DBLP
15 The architecture of an implementation of Prolog: Prolog /Mal.. (context) - Brisset, Ridoux - 1992
12 The representation of logics in higher-order logic (context) - Paulson - 1987
11 Implementing polymorphic typing in a logic programming langu.. - Kwon, Nadathur et al. - 1992 ACM DBLP
11 A notation for lambda terms II: Refinements and applications - Nadathur, Wilson - 1993
9 Hereditary Harrop formulas and logic programming (context) - Miller - 1987
7 Implemented as part of the CMU ERGO project (context) - Elliott, Pfenning et al. - 1989
5 Prolog and Quintus Prolog source code (context) - Miller, Nadathur et al. - 1988
5 An instruction set for higher-order hereditary Harrop formul.. (context) - Kwon, Nadathur - 1992
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