On flowchart theories: part II. The nondeterministic case
Theoretical Computer Science
Information and Computation
Towards a new algebraic foundation of flowchart scheme theory
Fundamenta Informaticae
Classes of finite relations as initial abstract data types I
Discrete Mathematics
Term graph rewriting: theory and practice
Term graph rewriting: theory and practice
An axiomatization of the algebra of Petri net concatenable processes
Theoretical Computer Science
Equational term graph rewriting
Fundamenta Informaticae - Special issue on graph transformations
Interaction categories and the foundations of typed concurrent programming
Proceedings of the NATO Advanced Study Institute on Deductive program design
Proof, language, and interaction
A Tile-Based Coordination View of Asynchronous pi-Calculus
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Mapping tile logic into rewriting logic
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
An inductive view of graph transformation
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Functorial Semantics for Multi-algebras
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Span(Graph): A Categorial Algebra of Transition Systems
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Axioms for Contextual Net Processes
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A 2-Categorical Presentation of Term Graph Rewriting
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Premonoidal categories and notions of computation
Mathematical Structures in Computer Science
Observational Equivalence for Synchronized Graph Rewriting with Mobility
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Functorial Semantics for Multi-algebras
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Tile Transition Systems as Structured Coalgebras
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Recently there has been a growing interest towards algebraic structures that are able to express formalisms different from the standard tree-like presentation of terms. Many of these approaches reveal a specific interest towards their application in the "distributed and concurrent systems" field, but an exhaustive comparison between them is dificult because their presentations can be quite dissimilar. This work is a first step towards a unifiled view, which is able to recast all those formalisms into a more general one, where they can be easily compared. We introduce a general schema for describing a characteristic normal form for many algebraic formalisms, and show that those normal forms can be thought of as arrows of suitable concrete monoidal categories.