RTA
2000
Springer
13 years 11 months ago
2000
Springer
RTA
2000
Springer
13 years 11 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 ...
RTA
2000
Springer
13 years 11 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
RTA
2000
Springer
13 years 11 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 11 months ago
2000
Springer
ACMSE
1995
ACM
13 years 11 months ago
1995
ACM
{ Traditional computer applications have been designed to be run by one user at a time who does some work in a single medium, such as ASCII text, and very little regard has been gi...
ACM
1995
13 years 11 months ago
1995
ACM
1995
13 years 11 months ago
1995
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
ACM
1995
13 years 11 months ago
1995
ACM
1995
13 years 11 months ago
1995
: Systems are written in systems implementation languages. What characterizes such languages in the mid-1990’s? This paper identifies the typical environment that a system is bei...