The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
From MaRDI portal
Publication:3130301
DOI10.1017/S096012951600027XzbMath1387.68063arXiv1511.08851OpenAlexW2962885085MaRDI QIDQ3130301
Kazuyuki Asada, Makoto Hamana, Kazutaka Matsuda
Publication date: 11 January 2018
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.08851
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Categorical semantics of formal languages (18C50)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete inference system for a class of regular behaviours
- Paramorphisms
- Iteration theories of synchronization trees
- Group axioms for iteration
- Combinatory reduction systems: Introduction and survey
- Infinite trees and completely iterative theories: A coalgebraic view
- Calculi for interaction
- An algebraic presentation of term graphs, via gs-monoidal categories
- Pure bigraphs: structure and dynamics
- Initial Algebra Semantics for Cyclic Sharing Tree Structures
- Correct Looping Arrows from Cyclic Terms
- Relating coalgebraic notions of bisimulation
- Axioms for bigraphical structure
- Small-step and big-step semantics for call-by-need
- Languages that Capture Complexity Classes
- Equational axioms for regular sets
- Categories for Types
- Premonoidal categories and notions of computation
- Traced Premonoidal Categories
- Continuous Additive Algebras and Injective Simulations of Synchronization Trees
- Term Rewriting and All That
- Traced monoidal categories
- Marker-Directed Optimization of UnCAL Graph Transformations
- Purely functional lazy nondeterministic programming
- The Algebra of Directed Acyclic Graphs
- Parallel functional programming on recursively defined data via data-parallel recursion
- Solving polynomial fixed point equations
- Bidirectionalizing graph transformations
- A new notation for arrows
- Structural recursion for querying ordered graphs
- Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories.
- Monads of coalgebras: rational terms and term graphs
- Two Complete Axiom Systems for the Algebra of Regular Events
- Categorical algebra
- Inductive-data-type systems
