Quotienting the Delay Monad by Weak Bisimilarity
The delay datatype was introduced by Capretta  as a means to deal with partial functions (as in computability theory) in Martin-Löf type theory. It is a monad and it constitutes a constructive alternative to the maybe monad. It is often desirable to consider two delayed computations equal, if they terminate with equal values, whenever one of them terminates. The equivalence relation underlying this identification is called weak bisimilarity. In type theory, one commonly replaces quotients with setoids. In this approach, the delay monad quotiented by weak bisimilarity is still a monad. In this paper, we consider Hofmann’s alternative approach  of extending type theory with inductive-like quotient types. In this setting, it is difficult to define the intended monad multiplication for the quotiented datatype. We give a solution where we postulate some principles, crucially proposition extensionality and the (semi-classical) axiom of countable choice. We have fully formalized our results in the Agda dependently typed programming language.
- 5.Cockett, R., Díaz-Boïls, J., Gallagher, J., Hrubes, P.: Timed sets, complexity, and computability. In: Berger, U., Mislove, M. (eds.) Proceedings of 28th Conference on the Mathematical Foundations of Program Semantics, MFPS XXVIII. Electron. Notes in Theor. Comput. Sci., vol. 286, pp. 117–137. Elsevier, Amsterdam (2012)Google Scholar
- 9.Kraus, N., Escardó, M., Coquand, T., Altenkirch, T.: Notions of anonymous existence in Martin-Löf type theory. Manuscript (2014)Google Scholar
- 14.Troelstra, A.S., Van Dalen, D.: Constructivism in Mathematics: An Introduction, v. I. Studies in Logic and the Foundations of Mathematics, vol. 121. North-Holland, Amsterdam (1988)Google Scholar
- 15.The Univalent Foundations Program: Homotopy Type Theory: Univalent Foundations of Mathematics. Institute for Advanced Study, Princeton, NY (2013). http://homotopytypetheory.org/book