We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
It is shown how to make a transition from the Z formal notation [3] to the Business Object Notation (BON) [4]. It is demonstrated that BON has the expressive power of Z, with the ...
We present a type system for the programming language Erlang. The type system supports subtyping and declarationfree recursive types, using subtyping constraints. Our system is si...
Pinto and Reiter have argued that the Situation Calculus, improved with time handling axioms, subsumes the features of linear time temporal formalisms such as Event Calculus and I...
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...