Higher-order Unification via Explicit Substitutions (Extended Abstract) (1995)

Cached

Download Links

by Gilles Dowek , Thérèse Hardin , Claude Kirchner
Venue:Proceedings of LICS'95
Citations:103 - 13 self

Documents Related by Co-Citation

390 Explicit substitutions – M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy - 1996
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
120 Confluence properties of Weak and Strong Calculi of Explicit Substitutions – Pierre-Louis Curien , Therese Hardin, Jean-Jacques Levy - 1996
98 λυ, a calculus of explicit substitutions which preserves strong normalisation – Z Benaissa, D Briaud, P Lescanne, J Rouyer-Degli - 1996
33 From oe to AE a journey through calculi of explicit substitutions – P Lescanne - 1994
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
22 Higher-order Uni via Explicit Substitutions – G Dowek, T Hardin, C Kirchner - 2000
8 Functional back-ends and compilers within the lambda-sigma calculus – T Hardin, L Maranget, B Pagano - 1995
164 Solving Equations in Abstract Algebras: a Rule-Based Survey of Unification – J-P Jouannaud, C Kirchner - 1991
22 Contributions `a l"etude de -calculs avec des substitutions explicites – A R'ios - 1993
80 Partial polymorphic type inference and higher-order unification – Frank Pfenning - 1988
27 On the undecidability of partial polymorphic type reconstruction – Frank Pfenning - 1992
103 Polymorphic type inference and containment – J C Mitchell - 1984
94 Putting Type Annotations to Work – Martin Odersky, Konstantin Läufer - 1996
166 How Good is Local Type Inference? – Haruo Hosoya, Benjamin C. Pierce - 1999
61 Polymorphic Type Inference and Abstract Data Types – Konstantin Läufer, Martin Odersky - 1994
78 A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus – A. J. Kfoury, J. B. Wells - 1993
357 Principal type-schemes for functional programs. Pages 207–212 of – Luis Damas, Robin Milner - 1982
472 Conditional rewriting logic as a unified model of concurrency – J Meseguer - 1992