scientific article
From MaRDI portal
Publication:3024908
zbMath1063.68599MaRDI QIDQ3024908
Publication date: 4 July 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Categorical semantics of formal languages (18C50) Combinatory logic and lambda calculus (03B40)
Related Items (34)
A Finite Axiomatisation of Finite-State Automata Using String Diagrams ⋮ Semantics of value recursion for Monadic Input/Output ⋮ From reversible programs to univalent universes and back ⋮ 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). ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ Drags: a compositional algebraic framework for graph rewriting ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ Unnamed Item ⋮ Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot ⋮ A string diagrammatic axiomatisation of finite-state automata ⋮ Complete Elgot monads and coalgebraic resumptions ⋮ Join inverse categories and reversible recursion ⋮ Towards a geometry of recursion ⋮ Categorical rewriting of term-like structures ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Two applications of analytic functors ⋮ The calculus of signal flow diagrams. I: Linear relations on streams. ⋮ Computing with Semirings and Weak Rig Groupoids ⋮ Join Inverse Categories as Models of Reversible Recursion ⋮ Inversion, Iteration, and the Art of Dual Wielding ⋮ GS·Λ Theories ⋮ The Uniformity Principle on Traced Monoidal Categories ⋮ A Categorical Semantics of Higher Order Store ⋮ Feedback for linearly distributive categories: Traces and fixpoints ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics ⋮ Normal forms for algebras of connections. ⋮ Dynamic connectors for concurrency ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic ⋮ A categorical model for the geometry of interaction ⋮ A calculus of coroutines
This page was built for publication:
