Page 1 Next

Displaying 1 – 20 of 72

Showing per page

Adhesive and quasiadhesive categories

Stephen Lack, Paweł Sobociński (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.

Adhesive and quasiadhesive categories

Stephen Lack, Paweł Sobociński (2010)

RAIRO - Theoretical Informatics and Applications

We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.

Coalgebras for binary methods : properties of bisimulations and invariants

Hendrik Tews (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Coalgebras for endofunctors 𝒞 𝒞 can be used to model classes of object-oriented languages. However, binary methods do not fit directly into this approach. This paper proposes an extension of the coalgebraic framework, namely the use of extended polynomial functors 𝒞 o p × 𝒞 𝒞 . This extension allows the incorporation of binary methods into coalgebraic class specifications. The paper also discusses how to define bisimulation and invariants for coalgebras of extended polynomial functors and proves many standard...

Coalgebras for Binary Methods: Properties of Bisimulations and Invariants

Hendrik Tews (2010)

RAIRO - Theoretical Informatics and Applications

Coalgebras for endofunctors 𝒞 𝒞 can be used to model classes of object-oriented languages. However, binary methods do not fit directly into this approach. This paper proposes an extension of the coalgebraic framework, namely the use of extended polynomial functors 𝒞 o p × 𝒞 𝒞 . This extension allows the incorporation of binary methods into coalgebraic class specifications. The paper also discusses how to define bisimulation and invariants for coalgebras of extended polynomial functors and proves many...

Compactness and Löwenheim-Skolem properties in categories of pre-institutions

Antonino Salibra, Giuseppe Scollo (1993)

Banach Center Publications

The abstract model-theoretic concepts of compactness and Löwenheim-Skolem properties are investigated in the "softer" framework of pre-institutions [18]. Two compactness results are presented in this paper: a more informative reformulation of the compactness theorem for pre-institution transformations, and a theorem on natural equivalences with an abstract form of the first-order pre-institution. These results rely on notions of compact transformation, which are introduced as arrow-oriented generalizations...

Complexity of λ -term reductions

M. Dezani-Ciancaglini, S. Ronchi Della Rocca, L. Saitta (1979)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Correctness of horizontal and vertical composition for implementation concepts based on constructors and abstractors.

Hartmut Ehrig, Hans-Jörg Kreowski, Fernando Orejas (1997)

Revista Matemática de la Universidad Complutense de Madrid

A new implementation concept for parameterized specifications based on constructors and abstractors was recently introduced by Orejas, Navarro and Sánchez which includes most of the implementation concepts in the literature for initial as well as loose semantics. In this paper we redefine vertical and different kinds of horizontal compositions using the new concept of semi-pushout defined for a mixture of signature and specification morphisms. The main results concerning correctness of horizontal...

Enumerated type semantics for the calculus of looping sequences

Livio Bioglio (2011)

RAIRO - Theoretical Informatics and Applications

The calculus of looping sequences is a formalism for describing the evolution of biological systems by means of term rewriting rules. In this paper we enrich this calculus with a type discipline which preserves some biological properties depending on the minimum and the maximum number of elements of some type requested by the present elements. The type system enforces these properties and typed reductions guarantee that evolution preserves them. As an example, we model the hemoglobin structure...

Currently displaying 1 – 20 of 72

Page 1 Next