We continue the study of Capretta's delay monad as a means of introducing non-termination from iteration into Martin-Löf type theory. In particular, we explain in what sense this monad provides a canonical solution. We discuss a class of monads that we call ω-complete pointed classifying monads. These are monads whose Kleisli category is an ω-complete pointed restriction category where pure maps are total. All such monads support non-termination from iteration: this is because restriction categories are a general framework for partiality; the presence of an ω-join operation on homsets equips a restriction category with a uniform iteration operator. We show that the delay monad, when quotiented by weak bisimilarity, is the initial ω-complete pointed classifying monad in our type-theoretic setting. This universal property singles it out from among other examples of such monads.
|Konference||14th International Colloquium on Theoretical Aspects of Computing, 2017|
|Periode||23/10/2017 → 27/10/2017|
|Navn||Lecture Notes in Computer Science|