Rewriting logic is a simple computational logic that can naturally express both concurrent
computation and logical deduction with great generality. This paper provides a gentle …

The theory and applications of rewriting logic have been vigorously developed by
researchers all over the world during the past eleven years. The attached bibliography …

FG h S h UWU i SU¥ § © h SI h SQ i'w Q\ac 4 aY w UYU f KY o TQQU a U jcao Q hh UQV\ac
4 h A n 5 5 E h T ««Q h VQ f V a T h V w Q jahh W r W [WV k V af Q ª UQV w Q 5©¤ jcaj Q c …

The reachability semantics for Petri nets can be studied using open Petri nets. For us, an
“open” Petri net is one with certain places designated as inputs and outputs via a cospan of …

Cet article poursuit notre etude de la th6orie gdn6rale des categories doubles faibles, en
traitant des adjonctions et des monades. Une adjonction double g6n6rale, telle qu'elle …

The paper presents a novel algebraic framework for specification and design of model
synchronization tools. The basic premise is that synchronization procedures, and hence …

We present new data structures for quasistrict higher categories, in which associativity and
unit laws hold strictly. Our approach has low axiomatic complexity compared to traditional …

As the twin movements of open science and open source bring an ever greater share of the
scientific process into the digital realm, new opportunities arise for the meta-scientific study …

The category of double categories and double functors is equipped with a symmetric closed
monoidal structure. For any double category AA, the corresponding internal hom functor …

The theory of associative n-categories has recently been proposed as a strictly associative
and unital approach to higher category theory. As a foundation for a proof assistant, this is …