3 search results - page 1 / 1 » hoa 1995 |
HOA
1995
13 years 8 months ago
1995
L.J. Steggles
HOA
1995
13 years 8 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
13 years 8 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...