1. Samson Abramsky, Richard Blute & Prakash Panangaden (1999): Nuclear and Trace Ideals in Tensored -Categories. J. Pure Appl. Algebra 143(1–3), pp. 3–47, doi:10.1016/S0022-4049(98)00106-6.
  2. Peter Aczel, JiříAdámek, Stefan Milius & JiříVelebil (2003): Infinite Trees and Completely Iterative Theories: A Coalgebraic View. Theoret. Comput. Sci. 300, pp. 1–45, doi:10.1016/S0304-3975(02)00728-4.
  3. JiříAdámek & Stefan Milius (2006): Terminal Coalgebras and Free Iterative Theories. Inform. and Comput. 204, pp. 1139–1172, doi:10.1016/j.ic.2005.11.005.
  4. Andrew W. Appel, Paul-André Melliès, Christopher D. Richards & Jérôme Vouillon (2007): A very modal model of a modern, major, general type system. In: Martin Hofmann & Matthias Felleisen: POPL. ACM, pp. 109–122. Available at
  5. Robert Atkey & Conor McBride (2013): Productive Coprogramming with Guarded Recursion. Accepted for ICFP.
  6. Eric Badouel (1989): Terms and infinite trees as monads over a signature. Lecture Notes Comput. Sci. 351, pp. 89–103, doi:10.1007/3-540-50939-9_126.
  7. Nick Benton & Nicolas Tabareau (2009): Compiling functional types to relational specifications for low level imperative code. In: Andrew Kennedy & Amal Ahmed: TLDI. ACM, pp. 3–14. Available at
  8. Lars Birkedal & Rasmus E. Møgelberg (2013): Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes. In: Proceedings of LICS, pp. 213–222, doi:10.1109/LICS.2013.27.
  9. Lars Birkedal, Rasmus E. Møgelberg, Jan Schwinghammer & Kristian Støvring (2012): First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees. Logical Methods in Computer Science 8(4:1), pp. 1–45, doi:10.2168/LMCS-8(4:1)2012.
  10. Stephen L. Bloom & Zoltán Ésik (1993): Iteration Theories: the equational logic of iterative processes. EATCS Monographs on Theoretical Computer Science. Springer.
  11. Roy L. Crole & Andrew M. Pitts (1992): New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and FIX-Logic. Inform. and Comput. 98(2), pp. 171–210, doi:10.1016/0890-5401(92)90018-B.
  12. Pietro Di Gianantonio & Marino Miculan (2004): Unifying Recursive and Co-recursive Definitions in Sheaf Categories. In: Igor Walukiewicz: Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science 2987. Springer Berlin / Heidelberg, pp. 136–150. Available at 10.1007/978-3-540-24727-2_11.
  13. Calvin C. Elgot (1975): Monadic Computation and Iterative Algebraic Theories. In: H. E. Rose & J. C. Sheperdson: Logic Colloquium '73 80. North-Holland Publishers, Amsterdam, pp. 175–230, doi:10.1007/978-1-4613-8177-8_6.
  14. Calvin C. Elgot, Stephen L. Bloom & Ralph Tindell (1978): On the algebraic structure of rooted trees. J. Comput. System Sci. 16, pp. 362–399, doi:10.1007/978-1-4613-8177-8_7.
  15. Masahito Hasegawa (1999): Models of Sharing Graphs: A Categorical Semantics of let and letrec. Distinguished Dissertation Series. Springer, doi:10.1007/978-1-4471-0865-8.
  16. Masihito Hasegawa (1997): Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi. In: Proc. 3rd International Conference on Typed Lambda Calculi and Applications, Lecture Notes Comput. Sci. 1210. Springer-Verlag, pp. 196–213, doi:10.1007/3-540-62688-3_37.
  17. André Joyal, Ross Street & Dominic Verity (1996): Traced Monoidal Categories. Math. Proc. Cambridge Philos. Soc. 119(3), pp. 447–468, doi:10.1017/S0305004100074338.
  18. Neelakantan R. Krishnaswami & Nick Benton (2011): A semantic model for graphical user interfaces. In: Manuel M. T. Chakravarty, Zhenjiang Hu & Olivier Danvy: ICFP. ACM, pp. 45–57. Available at
  19. Neelakantan R. Krishnaswami & Nick Benton (2011): Ultrametric Semantics of Reactive Programs. In: LICS. IEEE Computer Society. IEEE Computer Society, pp. 257–266. Available at
  20. Stefan Milius (2005): Completely Iterative Algebras and Completely Iterative Monads. Inform. and Comput. 196, pp. 1–41, doi:10.1016/j.ic.2004.05.003.
  21. Robin Milner (1989): Communication and Concurrency. International Series in Computer Science. Prentice Hall.
  22. Philip S. Mulry (1994): Lifting Theorems for Kleisli Categories. In: S. Brookes, M. Main, A. Melton, M. Mislove & D. Schmidt: Proc. Mathematical Foundations of Programming Semantics (MFPS'93), Lecture Notes Comput. Sci. 802. Springer, pp. 304–319, doi:10.1007/3-540-58027-1_15.
  23. Hiroshi Nakano (2000): A Modality for Recursion. In: LICS. IEEE Computer Society, pp. 255–266, doi:10.1109/LICS.2000.855774.
  24. Hiroshi Nakano (2001): Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness. In: Naoki Kobayashi & Benjamin C. Pierce: TACS, Lecture Notes in Computer Science 2215. Springer, pp. 165–182, doi:10.1007/3-540-45500-0_8.
  25. Alex Simpson & Gordon D. Plotkin (2000): Complete axioms for categorical fixed-point operators. In: Proc. 15th Symposium on Logic in Computer Science (LICS'00). IEEE Computer Society, pp. 30–41, doi:10.1109/LICS.2000.855753.

Comments and questions to:
For website issues: