Picture of rolled up £5 note

Open Access research that shapes economic thinking...

Strathprints makes available scholarly Open Access content by the Fraser of Allander Institute (FAI), a leading independent economic research unit focused on the Scottish economy and based within the Department of Economics. The FAI focuses on research exploring economics and its role within sustainable growth policy, fiscal analysis, energy and climate change, labour market trends, inclusive growth and wellbeing.

The open content by FAI made available by Strathprints also includes an archive of over 40 years of papers and commentaries published in the Fraser of Allander Economic Commentary, formerly known as the Quarterly Economic Commentary. Founded in 1975, "the Commentary" is the leading publication on the Scottish economy and offers authoritative and independent analysis of the key issues of the day.

Explore Open Access research by FAI or the Department of Economics - or read papers from the Commentary archive [1975-2006] and [2007-2018]. Or explore all of Strathclyde's Open Access research...

Quotienting the delay monad by weak bisimilarity

Chapman, James and Uustalu, Tarmo and Veltri, Niccolò (2017) Quotienting the delay monad by weak bisimilarity. Mathematical Structures in Computer Science. pp. 1-26. ISSN 0960-1295

Text (Chapman-etal-MSCS2017-Quotienting-the-delay-monad-by-weak-bisimilarity)
Accepted Author Manuscript

Download (481kB) | Preview


The delay datatype was introduced by Capretta (2005) as a means to deal with partial functions (as in computability theory) in Martin-Löf type theory. The delay datatype is a 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 datatype quotiented by weak bisimilarity is still a monad—a constructive alternative to the maybe monad. In this paper, we consider the alternative approach of Hofmann (1997) 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. With the aid of these principles, we also prove that the quotiented delay datatype delivers free ω-complete pointed partial orders (ωcppos). Altenkirch et al. (2017) demonstrated that, in homotopy type theory, a certain higher inductive-inductive type is the free ωcppo on a type X essentially by definition; this allowed them to obtain a monad of free ωcppos without recourse to a choice principle. We notice that, by a similar construction, a simpler ordinary higher inductive type gives the free countably-complete join semilattice on the unit type 1. This type suffices for constructing a monad which is isomorphic to the one of Altenkirch et al. We have fully formalized our results in the Agda dependently typed programming language.