Publication:3024908

zbMATH Open1063.68599MaRDI QIDQ3024908FDOQ3024908

Masahito Hasegawa

Publication date: 4 July 2005

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Categorical semantics of formal languages (18C50) Semantics in the theory of computing (68Q55)

Cited In (38)

• 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
• Correct Looping Arrows from Cyclic Terms
• Feedback for linearly distributive categories: Traces and fixpoints
• Title not available (Why is that?)
• Complete Elgot monads and coalgebraic resumptions
• A string diagrammatic axiomatisation of finite-state automata
• Title not available (Why is that?)
• The uniformity principle on traced monoidal categories
• Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot
• Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview
• From reversible programs to univalent universes and back
• Zeta functions and the (linear) logic of Markov processes
• 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
• The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• A categorical semantics of higher order store
• Title not available (Why is that?)
• Title not available (Why is that?)
• Inversion, Iteration, and the Art of Dual Wielding
• 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
• Title not available (Why is that?)
• 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
• A categorical model for the geometry of interaction
• Categorical rewriting of term-like structures

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)