Abbott M., Altenkirch T. and Ghani N. (2005). Containers: Constructing strictly positive types. Theoretical Computer Science
342
(1)
3–27.

Ahman D., Chapman J. and Uustalu T. (2014). When is a container a comonad?
Logical Methods in Computer Science
10
(3), article 14.

Altenkirch T., Danielsson N.A. and Kraus N. (2017). Partiality, revisited: The partiality monad as a quotient inductive-inductive type. In: Esparza J. and Murawski A. (eds.) Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2017, Lecture Notes in Computer Science, vol. 10203, Springer, Heidelberg, 534–549.

Bauer A., Gross J., Lumsdaine P.L., Shulman M., Sozeau M. and Spitters B. (2017). The HoTT library: A formalization of homotopy type theory in Coq. In: Proceedings of 6th ACM SIGPLAN Conference on Certified Programs and Proofs, CPP 2017, ACM, New York, 164–172.

Bauer A. and Lesnik D. (2012). Metric spaces in synthetic topology. Annals of Pure and Applied Logic
163
(2)
87–100.

Kennedy A. and Varming C. (2009). Some domain theory and denotational semantics in Coq. In: Berghofer S., Nipkow T.
Urban C. and Wenzel M. (eds.) Proceedings of 22nd International Conference on Theorem Proving in Higher Order Logics, TPHOLs 2009, Lecture Notes in Computer Science, vol. 5674, Springer, Heidelberg, 115–130.

Capretta V. (2005). General recursion via coinductive types. Logical Methods in Computer Science, 1
(2), article 1.

Chicli L., Pottier L. and Simpson C. (2003). Mathematical quotients and quotient types in Coq. In: Geuvers H. and Wiedijk F. (eds.) Selected Papers from Int. Wksh. on Types for Proofs and Programs, TYPES 2002, Lecture Notes in Computer Science, vol. 2646, Springer, Heidelberg, 95–107.

Cockett R., Díaz-Boïls J., Gallagher J. and Hrubes P. (2012). Timed sets, complexity, and computability. In: Berger U. and Mislove M. (eds.) Proceedings of 28th Conference on the Mathematical Foundations of Program Semantics, MFPS XXVIII, Electronic Notes in Theoretical Computer Science, vol. 286, Elsevier, Amsterdam, 117–137.

Escardó M. (2004). Synthetic topology of data types and classical spaces. In: Desharnais J. and Panangaden P. (eds.) Proceedings of Wksh. on Domain-Theoretical Methods for Probabilistic Programming, Electronic Notes in Theoretical Computer Science, vol. 87, Elsevier, Amsterdam, 21–156.

Goncharov S., Rauch C. and Schröder L. (2015). Unguarded recursion on coinductive resumptions. In: Ghica D. (ed.) Proceedings of 31st Conference on Mathematical Foundations of Programming Semantics, MFPS XXXI, Electronic Notes in Theoretical Computer Science, vol. 319, Elsevier, Amsterdam, 183–198.

Hofmann M. (1997).
*Extensional Constructs in Intensional Type Theory*
. CPHS/BCS Distinguished Dissertations. Springer, London.

Hyland J.M.E. (1990). First steps in synthetic domain theory. In: Carboni A., Pedicchio M. C. and Rosolini G. (eds.) Proceedings of International Conference on Category Theory, Lecture Notes in Mathematics, vol. 1488, Springer, Heidelberg, 131–156.

Hughes J. (2000). Generalising monads to arrows. Science of Computer Programming
37
(1–3)
67–111.

Jacobs B., Heunen C. and Hasuo I. (2009). Categorical semantics for arrows. Journal of Functional Programming
19
(3–4)
403–438.

Kraus N., Escardó M., Coquand T. and Altenkirch T. (2013). Generalizations of Hedberg's theorem. In: Hasegawa M. (ed.) Proceedings of 11th International Conference on Typed Lambda Calculi and Applications, TLCA 2013, Lecture Notes in Computer Science, vol. 7941, Springer, Heidelberg, 173–188.

Maietti M.E. (1999). About effective quotients in constructive type theory. In: Altenkirch T., Naraschewski W. and Reus B. (eds.) Selected Papers from International Wksh. on Types for Proofs and Programs, TYPES '98, Lecture Notes in Computer Science, vol. 1657, Springer, Heidelberg, 166–178.

Martin-Löf P. (2006). 100 years of Zermelo's axiom of choice: What was the problem with it?
Computer Journal
49
(3)
345–350.

Moggi E. (1991). Notions of computation and monads. Information and Computation
93
(1)
55–92.

Mulry P.S. (1994). Partial map classifiers and partial Cartesian closed categories. Theoretical Computer Science
136
(1)
109–123.

Norell U. (2009). Dependently typed programming in Agda. In: Koopman P., Plasmeijer R. and Swierstra S.D. (eds.) Revised Lectures from Proceedings of the 6th International School on Advanced Functional Programming, AFP 2008, Lecture Notes in Computer Science, vol. 5832, Springer, Heidelberg, 230–266.

Nuo L. (2015). *Quotient types in type theory*. PhD thesis, University of Nottingham.

Rosolini G. (1986). *Continuity and Effectiveness in Topoi*. PhD thesis, University of Oxford.

Troelstra A.S. and Van Dalen D. (1988). Constructivism in Mathematics: An Introduction, vol. I. Studies in Logic and the Foundations of Mathematics, vol. 121, North-Holland, Amsterdam.

The Univalent Foundations Program (2013). Homotopy Type Theory: Univalent Foundations of Mathematics. Institute for Advanced Study, Princeton, NY. http://homotopytypetheory.org/book.