Bharat Jayaraman, Debra Sue Wilson  Home/Search
Context
Related
| umn.edu/~gopalan/papers/hoimp.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: umn.edu/~gopalan/recentpapers (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 meta-language 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... (Update)
Similar documents (at the sentence level):
61.4%: Implementation Considerations for Higher-Order Features in.. - Nadathur, Wilson (1993) (Correct)
6.0%: A Treatment of Higher-Order Features in Logic Programming - Nadathur (2003) (Correct)
Active bibliography (related documents): More All
0.6: A Proof Procedure for the Logic of Hereditary Harrop Formulas - Nadathur (1993) (Correct)
0.5: Implementing a Notion of Modules in the Logic Programming .. - Kwon, Nadathur, Wilson (1993) (Correct)
0.5: Scoping Constructs in Logic Programming: Implementation.. - Nadathur, Jayaraman.. (1993) (Correct)
Similar documents based on text: More All
0.6: Cv - Haller (2000) (Correct)
0.6: A Notation for Lambda Terms I: A Generalization of Environments - Nadathur, Wilson (1994) (Correct)
0.5: A Notation for Lambda Terms: A Generalization of Environments - Nadathur, Wilson (1994) (Correct)
BibTeX entry: (Update)
@misc{ jayaraman-implementation,
author = "Bharat Jayaraman and Debra Sue Wilson",
title = "Implementation Considerations for Higher-Order Features in Logic Programming",
url = "citeseer.ist.psu.edu/552434.html" }
Citations (may not include all citations):419 A formulation of the simple theory of types (context) - Church - 1940
395 An abstract Prolog instruction set (context) - Warren - 1983
363 Programming in Prolog (context) - Clocksin, Mellish - 1984
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
172 Higher-order abstract syntax (context) - Pfenning, Elliot - 1988
144 Contributions to the theory of logic programming (context) - Apt, van Emden - 1982
125 Warren's Abstract Machine: A Tutorial Reconstruction (context) - t-Kaci - 1991
106 Lambda calculus notation with nameless dummies (context) - de Bruijn - 1972
106 The categorical abstract machine (context) - Cousineau, Curien et al. - 1987
54 Specifying and Implementing Theorem Provers in a Higher-Orde.. (context) - Felty - 1989
54 Partial polymorphic type inference and higher-order uni cati.. (context) - Pfenning - 1988
50 Higher-order Horn clauses - Nadathur, Miller - 1990
47 A logic programming approach to manipulating formulas and pr.. - Miller, Nadathur - 1987
46 Specifying theorem provers in a higher-order logic programmi.. (context) - Felty, Miller - 1988
42 On laziness and optimality in lambda interpreters: Tools for.. (context) - Field - 1990
38 A representation of lambda terms suitable for operations on .. (context) - Nadathur, Wilson - 1990
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 Levy (context) - Abadi, Cardelli et al. - 1990
25 Investigating a Proof-Theoretic Meta-Language for Functional.. (context) - Hannan - 1990
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
18 The type system of a higher-order logic programming language - Nadathur, Pfenning - 1992
16 Implementation techniques for scoping constructs in logic pr.. (context) - Jayaraman, Nadathur - 1991
16 Proving and applying program transformations expressed with .. (context) - erard, Bernard - 1978
12 A uni cation algorithm for typed -calculus (context) - erard - 1975
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
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
4 A notation for lambda terms II: Re nements and applications (context) - Nadathur, Wilson - 1993
4 Uses of higher-order uni cation for implementing program tra.. (context) - Hannan, Miller - 1988
2 Naive reverse can be linear (context) - Brisset, Ridoux - 1991
1 Prolog: Prolog /Mali (context) - Brisset, Ridoux et al. - 1992
Documents on the same site (http://www-users.cs.umn.edu/~gopalan/recentpapers.html): More
The Metalanguage Prolog and Its Implementation - Nadathur (Correct)
Tradeoffs in the Intensional Representation of Lambda Terms - Liang, Nadathur (Correct)
Implementing Polymorphic Typing in a Logic Programming.. - Kwon, Nadathur, Wilson (1993) (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