Inductive, coinductive, and pointed types

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 6, 1996, Pages 102-109

  Howard, Brian T ^a  

^a 129 Seaton Hall

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144411869     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/232629.232640     Document Type: Article

References (28)

1. Michael Barr. Algebraically compact functors. Journal of Pure and Applied Algebra, 82:211-231, 1992.
2. Wilfried Buchholz, Solomon Feferman, Wolfram Pohlers, and Wilfried Sieg. Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies. Number 897 in Lecture Notes in Mathematics. Springer-Verlag, 1981.
3. R. Cockett and T. Fukushima. About CHARITY. Technical Report 92/480/18, University of Calgary, June 1992.
4. Roy L. Croie and Andrew M. Pitts. New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic. Information and Computation, 98(2):171-210, June 1992.
5. Marcello P. Fiore. Axiomatic Domain Theory in Categories of Partial Maps. PhD thesis, University of Edinburgh, 1994.
6. Maarten M. Fokkinga and Erik Meijer. Program calculation properties of continuous algebras. Technical Report CS-R9104, CWI, January 1991.
7. Peter Freyd. Recursive types reduced to inductive types. In Fifth Annual IEEE Symposium on Logic in Computer Science, pages 498-507, 1990.
8. Peter Freyd. Algebraically complete categories. In A. Carboni, M.C. Pedicchio, and G. Rosolini, editors, Category Theory: Proceedings, Como 1990. pages 95-104. Springer-Verlag, 1991.
9. Peter Freyd. Remarks on algebraically compact categories. In M.P. Fourman, P.T. Johnstone, and A.M. Pitts, editors, Applications of Categories in Computer Science, number 177 in London Mathematical Society Lecture Note Series, pages 95-106. Cambridge University Press, 1992. Proceedings of the LMS Symposium, Durham 1991.
10. Peter Freyd. Remarks on algebraically compact categories. In M.P. Fourman, P.T. Johnstone, and A.M. Pitts, editors, Applications of Categories in Computer Science, number 177 in London Mathematical Society Lecture Note Series, pages 95-106. Cambridge University Press, 1992. Proceedings of the LMS Symposium, Durham 1991.
11. Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
12. Brian T. Howard. Fixed Points and Extensionality in Typed Functional Programming Languages. PhD thesis, Stanford University, 1992. Published as Stanford Computer Science Department Technical Report STAN-CS-92-1455.
13. Brian T. Howard. Inductive, projective, and retractive types. Technical Report MS-CIS-93-14, Department of Computer and Information Science, University of Pennsylvania, 1993.
14. Brian T. Howard. The expressive power of inductive and coinductive types. Presented at the Tenth Workshop on the Mathematical Foundations of Programming Semantics, March 1994.
15. Richard B. Kieburtz. Inductive programming. Technical Report CS/E 93-001, Oregon Graduate Institute of Science and Technology, 1993.
16. Jan Willem Klop. Combinatory Reduction Systems. PhD thesis, University of Utrecht, 1980. Published as Mathematical Center Tract 129.
17. John Launchbury and Ross Paterson. Parametricity and unboxing with unpointed types. Available at http://www.cse.ogi.edu/∼jl/ Papers/point.ps, 1995.
18. J. Lambek and P.J. Scott. Introduction to Higher-Order Categorical Logic. Number 7 in Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1986.
19. Erik Meijer. Calculating Compilers. PhD thesis, University of Nijmegen, 1992.
20. Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In J. Hughes, editor, Proceedings of the Fifth ACM Conference on Functional Programming Languages and Computer Architecture, number 523 in Lecture Notes in Computer Science, pages 124-144. Springer-Verlag, 1991.
21. John C. Mitchell. Type systems for programming languages. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 8, pages 365-458. Elsevier, 1990.
22. Eugenio Moggi. Computational lambda-calculus and monads. In Fourth Annual IEEE Symposium on Logic in Computer Science, pages 14-23, 1989.
23. Eugenio Moggi. Metalanguages and applications. Available as HL-notes.dvi.gz by anonymous ftp from theory.doc.ic.ac.uk in directory tfm/papers/MoggiE, October 1995.
24. Philip S. Mulry. Strong monads, algebras and fixed points. In M.P. Fourman, P.T. Johnstone, and A.M. Pitts, editors, Applications of Categories in Computer Science, number 177 in London Mathematical Society Lecture Note Series, pages 202-216. Cambridge University Press, 1992. Proceedings of the LMS Symposium, Durham 1991.
25. Philip S. Mulry. Strong monads, algebras and fixed points. In M.P. Fourman, P.T. Johnstone, and A.M. Pitts, editors, Applications of Categories in Computer Science, number 177 in London Mathematical Society Lecture Note Series, pages 202-216. Cambridge University Press, 1992. Proceedings of the LMS Symposium, Durham 1991.
26. Philip S. Mulry. Lifting theorems for kleisli categories. In S. Brookes, M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Ninth International Conference on Mathematical Foundations of Programming Semantics, number 802 in Lecture Notes in Computer Science, pages 304-319. Springer-Verlag, 1993.
27. Alex K. Simpson. Recursive types in kleisli categories. Available as kleisli.dvi.Z by anonymous ftp from ftp.dcs.ed.ac.uk in directory pub/als, August 1992.
28. Michael B. Smyth and Gordon D. Plotkin. The category-theoretic solution of recursive domain equations. SIAM Journal on Computing, 11:761-783, 1982.