7 search results - page 1 / 2 » rta 2000 |
RTA
2000
Springer
13 years 8 months ago
2000
Springer
RTA
2000
Springer
13 years 8 months ago
2000
Springer
RTA
2000
Springer
13 years 8 months ago
2000
Springer
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
RTA
2000
Springer
13 years 8 months ago
2000
Springer
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
OOPSLA
2000
Springer
13 years 8 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...