Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically

Informatica

Volumn 10, Issue 1, 1999, Pages 5-26

  Uustalu, Tarmo ^a   Vene, Varmo ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF TARTU   (Estonia)

Author keywords

(co)datatypes; Category theory; Forms of (co)recursion; Program calculation; Typed (total) functional programming

Indexed keywords

EID: 0006903554     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. Bird, R. S. (1987). An introduction to the theory of lists. In M. Broy.(Ed.), Logic of Programming and Calculi of Discrete Design (NATO ASI Series F), Vol. 36. Springer-Verlag, Berlin. pp. 5-42.
2. Fokkinga, M. M. (1992). Law and Order in Algorithmics. PhD thesis, University of Twente. iv+161 pp.
3. Geuvers, H. (1992). Inductive and coinductive types with iteration and recursion. In B. Nordström, K. Pettersson, and G. Plotkin (Eds.), Informal Proceedings of the Workshop on Types for Proofs and Programs, Båstad, June 1992. Dept. of Computer Sciences, Chalmers Univ. of Technology and Göteborg Univ. pp. 193-217. URL ftp://ftp.cs.chalmers.se/pub/cs-reports/baastad.92/.
4. Grundy, J. (1996). A browsable format for proof presentation. Mathesis Universalis, 2. URL http://saxon.pip.com.pl/MathUniversalis/2/.
5. Hagino, T. (1987). A Categorical Programming Language. PhD thesis CST-47-87, Univ. of Edinburgh. vii+180 pp.
6. Jacobs, B., and J. Rutten. (1997). A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS, 62, 222-259.
7. Lambek, J. (1968). A fixpoint theorem for complete categories. Mathematische Zeitschrift, 103, 151-161.
8. Malcolm, G. (1990). Data structures and program transformation. Science of Computer Programming, 14(2-3), 255-279.
9. Meertens, L. (1992). Paramorphisms. Formal Aspects of Computing, 4(5), 413-424.
10. Turner, D. A. (1995). Elementary strong functional programming. In P. H. Hartel and R. Plasmeijer (Eds.), Proceedings of the 1st Internat. Symp. on Functional Programming Languages in education, FPLE'95, (Lecture Notes in Computer Science), Nijmegen, Dec. 1995, Vol. 1022. Springer-Verlag, Berlin. pp. 1-13.
11. Uustalu, T., and V. Vene. (1997). A cube of proof systems for the intuitionistic predicate μ-,ν-logic. In M. Haveraaen and O. Owe (Eds.), Selected Papers of the 8th Nordic Workshop on Programming Theory, NWPT'96, Oslo, Dec. 1996, Research Report 248, Dept. of Informatics, Univ. of Oslo. pp. 237-246.
12. Vene, V., and T. Uustalu. (1998). Functional programming with apomorphisms (corecursion). Proceedings of the Estonian Academy of Sciences: Physics, Mathematics, 47(3), 147-161.
13. Vesely, P. (1997). Typechecking the Charity term logic. Unpublished notes. 21 pp. URL http://www.cpsc.ucalgary.ca/projects/charity/home.html.
14. Vos, T. (1995). Program Construction and Generation Based on Recursive Types. MSc thesis INF/SCR-95-12, Univ. of Utrecht. 235 pp.