Representations of First Order Function Types as Terminal Coalgebras
We show that function types which have only initial algebras for regular functors in the domains, i.e. first order function types, can be represented by terminal coalgebras for certain nested functors. The representation exploits properties of ωop-limits and local ω-colimits.
Unable to display preview. Download preview PDF.
- [AR99]T. Altenkirch and B. Reus. Monadic presentations of lambda terms using generalized inductive types. In Computer Science Logic, 1999.Google Scholar
- [BBvGvdW96]R. Backhouse, R. Bijsterveld, R. van Geldrop, and J. van der Woude. Category theory as coherently constructive lattice theory. available from http://www.cs.nott.ac.uk/~rcb/papers/papers.html, December 1996. Working Document.
- [Bla00]P. Blampied. Structured recursion for non-uniform data-types. PhD thesis, School of Computer Science and IT at the University of Nottingham, UK, 2000.Google Scholar
- [CS92]J. R. B. Cockett and D. Spencer. Strong categorical datatypes I. In R. A. G. Seely, editor, Proceedings Intl. Summer Category Theory Meeting, Montréal, Québec, 23–30 June 1991, volume 13 of Canadian Mathematical Society Conf. Proceedings. American Mathematical Society, 1992.Google Scholar
- [Hin00a]R. Hinze. Generalizing generalized tries. Journal of Functional Programming, 2000.Google Scholar
- [Hin00b]R. Hinze. Memo functions, polytypically! In Johan Jeuring, editor, Proceedings of the Second Workshop on Generic Programming, WGP 2000, 2000.Google Scholar
- [Jon98]G. Jones. Tabulation for type hackers. Available from ftp://ftp.comlab.ox.ac.uk/, 1998.
- [PS78]G. D. Plotkin and M. B. Smyth. The category-theoretic solution of recursive domain equations. SIAM Journal on Computing, 11, 1978.Google Scholar