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

391 Explicit substitutions – M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy - 1996
1121 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
751 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
857 A formulation of the simple theory of types – Alonzo Church - 1940
954 T.: Term rewriting and all that – F Baader, Nipkow - 1998
1581 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
306 Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem – N. G. De Bruijn - 1972
481 Conditional rewriting logic as a unified model of concurrency – J Meseguer - 1992