Results 1 -
2 of
2
Higher-order Unification via Explicit Substitutions (Extended Abstract)
- Proceedings of LICS'95
, 1995
"... Higher-order unification is equational unification for βη-conversion. But it is not first-order equational unification, as substitution has to avoid capture. In this paper higher-order unification is reduced to first-order equational unification in a suitable theory: the λσ-cal ..."
Abstract
-
Cited by 95 (11 self)
- Add to MetaCart
Higher-order unification is equational unification for βη-conversion. But it is not first-order equational unification, as substitution has to avoid capture. In this paper higher-order unification is reduced to first-order equational unification in a suitable theory: the λσ-calculus of explicit substitutions.
