6 papers · 1 filter
Multi-clocked Guarded Recursion Beyond ω
Rasmus Ejlers Møgelberg
Type theories with multi-clocked guarded recursion provide a flexible framework for programming with coinductive types encoding productivity in types. Combining this with solutions…
Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability
Giorgio Bacci, Rasmus Ejlers Møgelberg
Quantitative logic reasons about the degree to which formulas are satisfied. This paper studies the fundamental reasoning principles of higher-order quantitative logic and their ap…
What Monads Can and Cannot Do with a Few Extra Pages
Rasmus Ejlers Møgelberg, Maaike Zwart
The delay monad provides a way to introduce general recursion in type theory. To write programs that use a wide range of computational effects directly in type theory, we need to c…
Bisimulation as path type for guarded recursive types
Rasmus Ejlers Møgelberg, Niccolò Veltri
In type theory, coinductive types are used to represent processes, and are thus crucial for the formal verification of non-terminating reactive programs in proof assistants based o…
The clocks they are adjunctions:Denotational semantics for Clocked Type Theory
Bassel Mannaa, Rasmus Ejlers Møgelberg
Clocked Type Theory (CloTT) is a type theory for guarded recursion useful for programming with coinductive types, allowing productivity to be encoded in types, and for reasoning ab…
Denotational semantics for guarded dependent type theory
Aleš Bizjak, Rasmus Ejlers Møgelberg
We present a new model of Guarded Dependent Type Theory (GDTT), a type theory with guarded recursion and multiple clocks in which one can program with, and reason about coinductive…