The clocks are ticking: no more delays!: Reduction semantics for type theory with guarded recursion
From MaRDI portal
Publication:5144643
Recommendations
Cited in
(24)- Temporal refinements for guarded recursive types
- Productive coprogramming with guarded recursion
- Modal FRP for all: Functional reactive programming without space leaks in Haskell
- Guarded computational type theory
- A stratified approach to Löb induction
- scientific article; zbMATH DE number 1189292 (Why is no real title available?)
- When programs have to watch paint dry
- Modal dependent type theory and dependent right adjoints
- A model of PCF in guarded type theory
- Greatest HITs: higher inductive types in coinductive definitions via induction under clocks
- Streams of approximations, equivalence of recursive effectful programs
- Programming and reasoning with guarded recursion for coinductive types
- A formalized proof of strong normalization for guarded recursive types
- Guarded dependent type theory with coinductive types
- Transpension: the right adjoint to the Pi-type
- Multimodal dependent type theory
- Guarded cubical type theory: path equality for guarded recursion
- Intensional type theory with guarded recursive types qua fixed points on universes
- Denotational semantics for guarded dependent type theory
- scientific article; zbMATH DE number 7559298 (Why is no real title available?)
- Denotational semantics of recursive types in synthetic guarded domain theory
- The clocks they are adjunctions. Denotational semantics for clocked type theory
- A model of guarded recursion with clock synchronisation
- Guarded recursive datatype constructors
This page was built for publication: The clocks are ticking: no more delays!: Reduction semantics for type theory with guarded recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144643)
