3 search results - page 1 / 1 » hoa 1995 |
210
Voted
HOA
1995
15 years 10 months ago
1995
L.J. Steggles
193
click to vote
HOA
1995
15 years 10 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...
185
Voted
CSFW
1995
IEEE
15 years 10 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...