ility concepts in abstract data type specification, 30 years later Donald Sannella1 and Andrzej Tarlecki2,3 1 Laboratory for Foundations of Computer Science, University of Edinburg...
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
e [43] is the first paper on final, observational semantics in abstract data types, and the main reference for one of the MoC contributed papers in this volume. It presented severa...
We show that the category FinVectk of finite dimensional vector spaces and linear maps over any field k is (collectively) complete for the traced symmetric monoidal category freely...
Masahito Hasegawa, Martin Hofmann, Gordon D. Plotk...
In network applications it is crucial to have a mechanism to guarantee that communications evolve correctly according to the agreed protocol. Session types offer a method for abstr...
Lorenzo Bettini, Sara Capecchi, Mariangiola Dezani...
In this paper, we give an overview of the framework of graph transformation units which provides syntactic and semantic means for analyzing, modeling, and structuring all kinds of ...
Abstract. COWS is a recently defined process calculus for specifying and combining service-oriented applications, while modelling their dynamic behaviour.
Alessandro Lapadula, Rosario Pugliese, Francesco T...
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
We construct a model without precipitous ideals but so that for each < 3 there is a normal ideal over 1 with generic ultrapower wellfounded up to the image of .