scientific article; zbMATH DE number 2185716
From MaRDI portal
Publication:3024908
Recommendations
Cited in
(39)- Categorical rewriting of term-like structures
- Equational properties of fixed point operations in Cartesian categories: an overview
- A calculus of coroutines
- Towards a geometry of recursion
- Dynamic connectors for concurrency
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Semantics of value recursion for Monadic Input/Output
- scientific article; zbMATH DE number 1393359 (Why is no real title available?)
- Correct Looping Arrows from Cyclic Terms
- Computing with semirings and weak rig groupoids
- Join inverse categories as models of reversible recursion
- Feedback for linearly distributive categories: Traces and fixpoints
- Complete Elgot monads and coalgebraic resumptions
- A string diagrammatic axiomatisation of finite-state automata
- scientific article; zbMATH DE number 7456059 (Why is no real title available?)
- The uniformity principle on traced monoidal categories
- From reversible programs to univalent universes and back
- Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot
- Zeta functions and the (linear) logic of Markov processes
- The calculus of signal flow diagrams. I: Linear relations on streams.
- Equational properties of fixed-point operations in Cartesian categories: an overview
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
- A categorical semantics of higher order store
- scientific article; zbMATH DE number 7450001 (Why is no real title available?)
- scientific article; zbMATH DE number 7453172 (Why is no real title available?)
- A structural and nominal syntax for diagrams
- A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA).
- GS\(\cdot \Lambda \) theories: a syntax for higher-order graphs
- Traced monoidal categories as algebraic structures in Prof
- Two applications of analytic functors
- A Finite Axiomatisation of Finite-State Automata Using String Diagrams
- scientific article; zbMATH DE number 7437711 (Why is no real title available?)
- Normal forms for algebras of connections.
- Drags: a compositional algebraic framework for graph rewriting
- Join inverse categories and reversible recursion
- A compositional approach to parity games
- Inversion, iteration, and the art of dual wielding
- A categorical model for the geometry of interaction
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3024908)
