The Semantic Web and its technologies become increasingly important. As more and more Semantic Web applications are being used, developing more stable Semantic Web applications be...
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
The existing standard for object-oriented databases (ODMG) provides no facility for storing behaviour. This lack of stored behaviour introduces problems for generic applications as...