Quotienting the delay monad by weak bisimilarity
DOI10.1017/S0960129517000184zbMATH Open1407.68306OpenAlexW2767001837MaRDI QIDQ4559601FDOQ4559601
Authors: James Chapman, Tarmo Uustalu, Niccolò Veltri 
Publication date: 4 December 2018
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129517000184
Recommendations
- Quotienting the delay monad by weak bisimilarity
- The delay monad and restriction categories
- Weak bisimulations for the Giry monad
- Weak Bisimulations for the Giry Monad (Extended Abstract)
- Weak bisimulation for coalgebras over order enriched monads
- Coalgebraic Weak Bisimulation from Recursive Equations over Monads
- The weak theory of monads
- Quotient monoids and concurrent behaviours
- scientific article; zbMATH DE number 3841844
- The Vietoris monad and weak distributive laws
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)
Cites Work
- Dependently typed programming in Agda
- General Recursion via Coinductive Types
- Notions of computation and monads
- Containers: Constructing strictly positive types
- When is a container a comonad?
- Timed Sets, Functional Complexity, and Computability
- Categorical semantics for arrows
- Metric spaces in synthetic topology
- Generalising monads to arrows
- Constructivism in mathematics. An introduction. Volume II
- Title not available (Why is that?)
- Synthetic topology: of data types and classical spaces
- Extensional Constructs in Intensional Type Theory
- Title not available (Why is that?)
- Generalizations of Hedberg's theorem
- Partial map classifiers and partial cartesian closed categories
- Unguarded recursion on coinductive resumptions
- Partiality, Revisited
Cited In (12)
- Streams of approximations, equivalence of recursive effectful programs
- Formalizing CCS and \(\pi\)-calculus in Guarded Cubical Agda
- Constructing higher inductive types as groupoid quotients
- The construction of set-truncated higher inductive types
- The delay monad and restriction categories
- Quotienting the delay monad by weak bisimilarity
- Greatest HITs: higher inductive types in coinductive definitions via induction under clocks
- Inductive and coinductive predicate liftings for effectful programs
- Two guarded recursive powerdomains for applicative simulation
- The Scott model of PCF in univalent type theory
- A type system with subtyping for WebAssembly's stack polymorphism
- Title not available (Why is that?)
Uses Software
This page was built for publication: Quotienting the delay monad by weak bisimilarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559601)
