A completeness theorem in the modal logic of programs
A deductive calculus for conditional equational systems with built-in predicates as premises.
A normal form for restricted exponential functions
À propos de la sémantique de l'appel par valeur selon A. Arnold
A simplification functor for coalgebras.
A theory of software reusability
Adhesive and quasiadhesive categories
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
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.
An algorithm for finding a minimal recursive path ordering
Closed sets of universal Horn formulas for many-sorted (partial) algebras
Coalgebras for binary methods : properties of bisimulations and invariants
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 . 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
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. 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
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
Construction d'un plus petit ordre de simplification
Correctness of horizontal and vertical composition for implementation concepts based on constructors and abstractors.
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...
Decidable subcases of the equivalence problem for recursive program schemes
Deduction over graphs under constraints : a soundness and completeness theorem
Demonic semantics: using monotypes and residuals.
Enumerated type semantics for the calculus of looping sequences
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 and...