Naive Reverse can be Linear (1991)

Cached

Download Links

by Pascal Brisset , Olivier Ridoux
Venue:8th Int. Conf. Logic Programming
Citations:18 - 5 self

Documents Related by Co-Citation

169 A unification algorithm for typed -calculus – G Huet - 1975
374 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
291 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
176 An overview of -prolog – D Miller, G Nadathur - 1988
302 Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem – N. G. De Bruijn - 1972
15 The architecture of an implementation of Prolog: Prolog/Mali – P Brisset, O Ridoux - 1992
35 A Semi-Functional Implementation of a Higher-Order Logic Programming Language – Conal Elliott, Frank Pfenning - 1991
30 A representation of lambda terms suitable for operations on their intensions – Gopalan Nadathur, Debra Sue Wilson - 1990
854 A formulation of the simple theory of types – Alonzo Church - 1940
155 Higher-order logic programming – Gopalan Nadathur, Dale Miller
66 Implementing Tactics and Tacticals in a Higher-Order Logic Programming Language – Amy Felty - 1993
59 From operational semantics to abstract machines – John Hannan, Dale Miller - 1992
14 Implementation Considerations for Higher-Order Features in Logic Programming – Gopalan Nadathur, Bharat Jayaraman, Debra Sue Wilson - 1993
61 Unification and Anti-Unification in the Calculus of Constructions – Frank Pfenning - 1991
141 A Polymorphic Type System For Prolog – A Mycroft, R O'Keefe - 1984
28 Hereditary Harrop formulas and uniform proof systems – D A Miller, G Nadathur, A Scedrov - 1987
175 Logic Programming in the LF Logical Framework – Frank Pfenning - 1991
25 Extending definite clause grammars with scoping constructs – Remo Pareschi, Dale Miller - 1990
64 Lexical scoping as universal quantification – Dale Miller - 1989