34 search results - page 2 / 7 » An Efficient Nominal Unification Algorithm |
80
Voted
COLING
1994
15 years 1 months ago
1994
The revised graph unification algorithms presented here are more efficient because they reduce the amount of copying that was necessary because of the assumption that data-structu...
ISMB
1996
15 years 1 months ago
1996
Weshowin this paper that manypopular models of folding and/or alignment maybe described by a new formalism: multi-tape S-attribute grammars(MTSAG's).This formalism relieves t...
136
Voted
ERSHOV
2009
Springer
15 years 4 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
PVLDB
2008
14 years 11 months ago
2008
Current skyline evaluation techniques assume a fixed ordering on the attributes. However, dynamic preferences on nominal attributes are more realistic in known applications. In or...
ICFP
2004
ACM
16 years 6 days ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...