1. Aczel, P. 1988. Non-wellfounded set theory, CSLI lecture notes, vol. 14, xx+137. Stanford: Stanford University, Center for the Study of Language and Information.
2. Agda. 2011 Email list archive. Available at
https://lists.chalmers.se/pipermail/agda/
.
3. Altenkirch, T. 2004. Codata. Talk given at the TYPES workshop in Jouy-en-Josas. Available from
http://www.cs.nott.ac.uk/~txa/talks/types04.pdf
, Dec 2004.
4. Altenkirch, T., and N.A. Danielsson. 2010. Termination checking nested inductive and coinductive types. In Proceedings of workshop on partiality and recursion in interactive theorem provers, PAR’10, Edinburgh.
5. Bertot, Y. 2006. CoInduction in Coq. Available from
http://arxiv.org/abs/cs/0603119
, Mar 2006.