The clocks are ticking: no more delays!: Reduction semantics for type theory with guarded recursion
From MaRDI portal
Publication:5144643
zbMATH Open1452.03031MaRDI QIDQ5144643FDOQ5144643
Authors: Patrick Bahr, Hans Bugge Grathwohl, Rasmus Ejlers Møgelberg 
Publication date: 19 January 2021
Full work available at URL: http://dl.acm.org/citation.cfm?id=3330032
Recommendations
Cited In (23)
- Title not available (Why is that?)
- Denotational semantics of recursive types in synthetic guarded domain theory
- When programs have to watch paint dry
- Transpension: the right adjoint to the Pi-type
- Temporal refinements for guarded recursive types
- Streams of approximations, equivalence of recursive effectful programs
- Guarded recursive datatype constructors
- Guarded computational type theory
- Productive coprogramming with guarded recursion
- A model of guarded recursion with clock synchronisation
- A model of PCF in guarded type theory
- Greatest HITs: higher inductive types in coinductive definitions via induction under clocks
- The clocks they are adjunctions. Denotational semantics for clocked type theory
- Denotational semantics for guarded dependent type theory
- Title not available (Why is that?)
- Modal dependent type theory and dependent right adjoints
- 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
- Intensional type theory with guarded recursive types qua fixed points on universes
- Guarded cubical type theory: path equality for guarded recursion
- Multimodal dependent type theory
- Modal FRP for all: Functional reactive programming without space leaks in Haskell
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)
