Abstract. We propose a general categorical setting for modeling program composition in which the call-by-value and call-by-name disciplines fit as special cases. Other notions of c...
We study an approach to relational databases which treats relations not as subsets of a Cartesian product but as subsets of some domain { a partially ordered space of descriptions...
Using relation algebra, we generalize Aumann’s notion of a contact relation and that of a closure operation from powersets to general membership relations and their induced parti...
In his well-known paper \How computer should think" ( Be77b]) Belnap argues that four-valued semantics is a very suitable setting for computerized reasoning. In this paper we...
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a s...
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, Ba...