A Notation for Lambda Terms I: A Generalization of Environments (1994)

Cached

Download Links

by Gopalan Nadathur , Debra Sue Wilson
Venue:THEORETICAL COMPUTER SCIENCE
Citations:33 - 12 self

Documents Related by Co-Citation

390 Explicit substitutions – M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy - 1996
176 An overview of -prolog – D Miller, G Nadathur - 1988
291 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
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
169 A unification algorithm for typed -calculus – G Huet - 1975
22 Higher-order Uni via Explicit Substitutions – G Dowek, T Hardin, C Kirchner - 2000
315 System Description: Twelf --- A Meta-Logical Framework for Deductive Systems – Frank Pfenning, Carsten Schurmann - 1999
854 A formulation of the simple theory of types – Alonzo Church - 1940
302 Higher-order abstract syntax – F Pfenning, C Elliott - 1988
374 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
26 Extending a -calculus with Explicit Substitution which Preserves Strong Normalisation into a Con Calculus on Open Terms – F Kamareddine, A Ros - 1997
34 System description: Teyjus—A compiler and abstract machine based implementation of λProlog – G Nadathur, D J Mitchell - 1999
30 A representation of lambda terms suitable for operations on their intensions – Gopalan Nadathur, Debra Sue Wilson - 1990
473 The Calculus of Constructions – T Coquand, G Huet - 1988
25 A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations – Gopalan Nadathur - 1996
20 Introduction to Combinatory Logic and Lambda Calculus – J Roger Hindley, Jonathan P Seldin - 1986
98 λυ, a calculus of explicit substitutions which preserves strong normalisation – Z Benaissa, D Briaud, P Lescanne, J Rouyer-Degli - 1996
175 Logic Programming in the LF Logical Framework – Frank Pfenning - 1991
114 A unification algorithm for typed λ-calculus – G Huet - 1975