The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Compared to imperative programming languages like Pascal or Basic, or functional programming languages like ML or Haskell learning Java is hampered by the fact that to get even th...
We develop an imperative calculus that provides a formal model for both single and mixin inheritance. By introducing classes and mixins as the basic object-oriented constructs in a...
In this paper I argue that syntactic categories are not part of UG but are acquired during first language acquisition as a result of doubling effects. In short, it is argued that a...
We follow the stack-baaed approach to query languages which is a new formal and intellectual paradigm for integrating querying and programming for object-oriented databases. Queri...
Kazimierz Subieta, Yahiko Kambayashi, Jacek Leszcz...