3 search results - page 1 / 1 » hoa 1995 |
107
Voted
HOA
1995
15 years 1 months ago
1995
L.J. Steggles
87
Voted
HOA
1995
15 years 1 months ago
1995
We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can...
CSFW
1995
IEEE
15 years 1 months ago
1995
IEEE
We investigate the formal relationship between separability of processes and the types of non-interference properties they enjoy. Though intuitively appealing, separability – th...