Quotienting the delay monad by weak bisimilarity

James Chapman, Tarmo Uustalu, Niccolò Veltri

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

22 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationTheoretical Aspects of Computing - ICTAC 2015
Subtitle of host publication12th International Colloquium, Cali, Colombia, October 29-31, 2015, Proceedings
Place of PublicationSwitzerland
Number of pages16
ISBN (Print)978-3-319-25149-3
Publication statusPublished - 20 Dec 2015

Publication series

NameLecture Notes in Computer Science


  • delay datatype
  • weak bisimilarity
  • non-terminal computations


Dive into the research topics of 'Quotienting the delay monad by weak bisimilarity'. Together they form a unique fingerprint.

Cite this