(Enter summary)
Abstract: ions *)
and varbind = Varbind of string * term (* Variable binders , Type *)
30
In the implementation of the term language and the type checker, we
have two constants type and pi. And, yes, type is a type, though this
could be avoided by introducing universes (see [16]) without any changes to
the code of the unier. As is customary, we use A ! B as an abbreviation
for x : A: B if x does not occur free in B. Also, however, x : A: B is an
abbreviation for the application pi A (x : A: B). In ... (Update)
Context of citations to this paper: More
.... even for calculi [AC96] Bar92] BC93] Cou99] Weaker frameworks and constructions by the computational means are used in [dB91] [EP91] [FPT99] NW90] Pfe00] Nevertheless, the initial notion of an object and concept became overloaded by the mismeaning and not signi cant...
.... lead to a signi cant interest in the language and several systems have been developed that implement Prolog or a close relative of it [4, 10, 11, 27]. These systems notwithstanding, a detailed consideration has not been given in the past to the design of implementation...
Cited by: More
Hierarchical Contextual Reasoning - Autexier (2003)
(Correct)
Model Checking Linear Logic Specifications - Bozzano, Delzanno, Martelli (2004)
(Correct)
A Treatment of Higher-Order Features in Logic Programming - Nadathur (2003)
(Correct)
Similar documents (at the sentence level):
65.2%: A Semi-Functional Implementation of a Higher-Order Logic.. - Elliott (1991)
(Correct)
Active bibliography (related documents): More All
0.5: Oracle-Based Checking of Untrusted Software - Necula, Rahul (2001)
(Correct)
0.4: Proof-search in Type-theoretic Languages: An Introduction - Galmiche, al. (2000)
(Correct)
0.3: Refinement Types for ML - Freeman (1994)
(Correct)
Similar documents based on text: More All
0.1: On the Edge Label Placement Problem - Kakoulis, Tollis (1997)
(Correct)
0.1: An Algorithm for Labeling Edges of Hierarchical Drawings - Kakoulis, Tollis (1997)
(Correct)
0.1: Updating Extended Logic Programs through Abduction - Sakama, Inoue (1999)
(Correct)
Related documents from co-citation: More All
20: Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
18: An unification algorithm for typed -calculus (context) - Huet - 1975
18: A logic programming language with lambda-abstraction
- Miller - 1991
BibTeX entry: (Update)
C.M. Elliott and F. Pfenning. A semi-functional implementation of a higher-order logic programming language. In P. Lee, editor, Topics in Advanced Language Implementation, pages 289--325, MIT Press, 1991. http://citeseer.ist.psu.edu/elliott90semifunctional.html More
@incollection{ elliott91semifunctional,
author = "Conal Elliott and Frank Pfenning",
title = "A Semi-Functional Implementation of a Higher-Order Logic Programming Language",
booktitle = "Topics in Advanced Language Implementation",
publisher = "MIT Press",
editor = "Peter Lee",
pages = "289--325",
year = "1991",
url = "citeseer.ist.psu.edu/elliott90semifunctional.html" }
Citations (may not include all citations):
419
A formulation of the simple theory of types (context) - Church - 1940 DBLP
340
Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1988 ACM DBLP
266
Information and Computation (context) - Coquand, erard et al. - 1988 DBLP
221
Constraint logic programming (context) - Ja, Jean-Louis - 1987 ACM DBLP
149
A logical analysis of modules in logic programming (context) - Miller - 1989 ACM DBLP
82
prolog: an extension of Prolog with hypothetical implication.. (context) - Gabbay, Reyle - 1985
82
prolog: an extension of Prolog with hypothetical implication.. (context) - Gabbay - 1985
54
Specifying and Implementing Theorem Provers in a HigherOrder.. (context) - Felty - 1989
46
Lambda-calculus notation with nameless dummies: a tool for a.. (context) - de Bruijn - 1972
46
A higher-order implementation of rewriting
- Paulson - 1983 DBLP
38
A representation of lambda terms suitable for operations on .. (context) - Nadathur, Wilson - 1990 ACM DBLP
21
Journal of Logic Programming (context) - Haynes - 1987
17
Expressing database queries with intuitionistic logic
- Bonner, McCarty et al. - 1989 DBLP
15
On implementing Prolog in functional programming (context) - Carlsson - 1984 DBLP
14
A unication algorithm for typed -calculus (context) - erard - 1975
14
Springer-Verlag LNCS (context) - Gordon, Milner et al. - 1979
9
Transliterating Prolog into Scheme (context) - Felleisen - 1985
6
Towards a WAM model for lambda Prolog (context) - Nadathur, Jayaraman - 1989 ACM
4
and typical ambiguity in the Calculus of Constructions (context) - Harper, Pollack et al. - 1989
3
Functional programming in Standard ML (context) - Harper, Milner et al. - 1988
3
Extensions and Applications of Higher-order Unication (context) - Elliott - 1990
2
Higher-order unication with dependent types (context) - Elliott - 1989
1
eLP: A Common Lisp implementation of Prolog in the Ergo Sup.. (context) - Elliott, Pfenning - 1989
1
Unication under mixed prexes (context) - Miller - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.microsoft.com/~conal/papers/default.htm): More
Functional Reactive Animation - Conal Elliott (1997)
(Correct)
Functional 3D Graphics in C++ - with an.. - Schechter.. (1994)
(Correct)
TBAG: A Highlevel Framework for Interactive, Animated 3D.. - Elliott, al. (1994)
(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