What monads can and cannot do with a bit of extra time
From MaRDI portal
Cites work
- A model of PCF in guarded type theory
- Combining effects: sum and tensor
- Cubical type theory: a constructive interpretation of the univalence axiom
- Denotational semantics of recursive types in synthetic guarded domain theory
- Discrete Lawvere theories and computational effects
- Distributing probability over non-determinism
- First steps in synthetic guarded domain theory: step-indexing in the topos of trees
- Fitch-style modal lambda calculi
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- General Recursion via Coinductive Types
- Greatest HITs: higher inductive types in coinductive definitions via induction under clocks
- Homotopy type theory. Univalent foundations of mathematics
- scientific article; zbMATH DE number 3910392 (Why is no real title available?)
- scientific article; zbMATH DE number 3982493 (Why is no real title available?)
- scientific article; zbMATH DE number 3549200 (Why is no real title available?)
- scientific article; zbMATH DE number 2087441 (Why is no real title available?)
- scientific article; zbMATH DE number 7559448 (Why is no real title available?)
- scientific article; zbMATH DE number 7288622 (Why is no real title available?)
- scientific article; zbMATH DE number 3296291 (Why is no real title available?)
- scientific article; zbMATH DE number 3319584 (Why is no real title available?)
- Inductive and coinductive predicate liftings for effectful programs
- Iterated covariant powerset is not a monad
- Layer by layer -- combining monads
- Monad compositions II: Kleisli strength
- Monad compositions. I: General constructions and recursive distributive laws
- Monad transformers for backtracking search
- Monads on symmetric monoidal closed categories
- Multimodal dependent type theory
- No-go theorems for distributive laws
- Partiality, Revisited
- Productive coprogramming with guarded recursion
- Quotienting the delay monad by weak bisimilarity
- Selection functions, bar recursion and backward induction
- The clocks are ticking: no more delays!: Reduction semantics for type theory with guarded recursion
- The validity of equations of complex algebras
- Two guarded recursive powerdomains for applicative simulation
This page was built for publication: What monads can and cannot do with a bit of extra time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856013)
