A Term-Graph Syntax for Algebras over Multisets
From MaRDI portal
Publication:3184730
DOI10.1007/978-3-642-03429-9_11zbMath1253.68228MaRDI QIDQ3184730
Publication date: 22 October 2009
Published in: Recent Trends in Algebraic Development Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03429-9_11
68Q65: Abstract data types; algebraic specification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classes of finite relations as initial abstract data types. II
- Graph transformation. 1st international conference, ICGT 2002, Barcelona, Spain, October 7--12, 2002. Proceedings
- Normal forms for algebras of connections.
- A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
- An algebraic presentation of term graphs, via gs-monoidal categories
- Quantifier-free logic for nondeterministic theories
- Institution-independent model theory
- Counting Paths: Nondeterminism as Linear Algebra
- Traced monoidal categories
- Categorical rewriting of term-like structures
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Graph rewriting for the π-calculus
- Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories