scientific article; zbMATH DE number 7080198
From MaRDI portal
Publication:4968384
zbMath1467.68082arXiv1712.09574MaRDI QIDQ4968384
Christoph Rauch, Lutz Schröder, Maciej Piróg, Sergei S. Goncharov
Publication date: 12 July 2019
Full work available at URL: https://arxiv.org/abs/1712.09574
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Eilenberg-Moore and Kleisli constructions for monads (18C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monads for behaviour
- The coinductive resumption monad
- A coinductive calculus for asynchronous side-effecting processes
- Equational properties of iterative monads
- Notions of computation and monads
- Introduction to extensive and distributive categories
- On the algebraic structure of rooted trees
- Infinite trees and completely iterative theories: A coalgebraic view
- Guarded traced categories
- Complete Elgot monads and coalgebraic resumptions
- Completely iterative algebras and completely iterative monads
- Quotienting the Delay Monad by Weak Bisimilarity
- Unifying Guarded and Unguarded Iteration
- Partiality, Revisited
- Elgot theories: a new perspective on the equational properties of iteration
- A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While
- Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion
- Coalgebraic Infinite Traces and Kleisli Simulations
- General Recursion via Coinductive Types
- Generic Trace Semantics via Coinduction
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
This page was built for publication:
