A type system for well-founded recursion

ACM SIGPLAN Notices

Volumn 39, Issue 1, 2004, Pages 293-305

  Dreyer, Derek ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Effect systems; Recursion; Recursive modules; Type systems

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; PROGRAM COMPILERS; RECURSIVE FUNCTIONS; RESPONSE TIME (COMPUTER SYSTEMS); SEMANTICS;

FUNCTIONAL LANGUAGES; MODULAR PROGRAMMING; RECURSION; RECURSIVE MODULES; TYPE SYSTEMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1442336643     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/982962.964026     Document Type: Conference Paper

References (31)

1. Samson Abramsky and Chris Hankin, editors. Abstract Interpretation of Declarative Languages. Ellis Horwood Limited, 1987.
2. Davide Ancona, Sonia Fagorzi, Eugenio Moggi and Elena Zucca. Mixin modules and computational effects. In 2003 International Colloquium on Languages, Automata and Programming, Eindhoven, The Netherlands, 2003.
3. Davide Ancona and Elena Zucca. A primitive calculus for module systems. In International Conference on Principles and Practice of Declarative Programming, volume 1702 of Lecture Notes in Computer Science, pages 62-79. Springer-Verlag, 1999.
4. Gerard Boudol. The recursive record semantics of objects revisited. Research report 4199, INRIA, 2001. To appear in the Journal of Functional Programming.
5. Karl Crary, Robert Harper, and Sidd Puri. What is a recursive module? In 1999 Conference on Programming Language Design and Implementation (PLDI), pages 50-63, Atlanta, GA.
6. Derek Dreyer, Karl Crary, and Robert Harper. A type system for higher-order modules. In 2003 ACM Symposium on Principles of Programming Languages, pages 236-249, 2003.
7. Derek Dreyer, Robert Harper, and Karl Crary. A type system for well-founded recursion. Technical Report CMU-CS-03-163, Carnegie Mellon University, July 2003.
8. Derek R. Dreyer, Robert Harper, and Karl Crary. Toward a practical type theory for recursive modules. Technical Report CMU-CS-01-112. School of Computer Science, Carnegie Mellon Universite, March 2001.
9. Dominic Duggan and Constantinos Sourelis. Mixin modules. In 1996 ACM SIGPLAN International Conference on Functional Programming, pages 262-273, Philadelphia, Pennsylvania, June 1996.
10. Dominic Duggan and Constantinos Sourelis. Parameterized modules, recursive modules, and mixin modules. In 1998 ACM SIGPLAN Workshop on ML, pages 87-96, Baltimore, Maryland, September 1998.
11. Levent Erkök and John Launchbury. Recursive monadic bindings. In 2000 International Conference on Functional Programming, pages 174-185, Paris, France, 2000.
12. Levent Erkök and John Launchbury. A recursive do for Haskell. In 2002 Haskell Workshop, October 2002.
13. Matthew Flatt and Matthias Felleisen. Units: Cool modules for HOT languages. In 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 236-248, Montreal, Canada, June 1998.
14. Daniel P. Friedman and Amr Sabry. Recursion is a computational effect. Technical Report TR546, Indiana University, December 2000.
15. John Greiner. Weak polymorphism can be sound. Journal of Functional Programming, 6(1):111-141, 1996.
16. Robert Harper and Mark Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Twenty-First ACM Symposium on Principles of Programming Languages, pages 123-137, Portland, OR, January 1994.
17. Tom Hirschowitz and Xavier Leroy. Mixin modules in a call-by-value setting. In 2002 European Symposium on Programming, volume 2305 of Lecture notes in Computer Science, pages 6-20, 2002.
18. Tom Hirschowitz, Xavier Leroy, and J. B. Wells. Compilation of extended recursion in call-by-value functional languages. In 2003 International Conference on Principles and Practice of Declarative Programming, Uppsala, Sweden.
19. 5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation, 11(1), September 1998.
20. Xavier Leroy. A proposal for recursive modules in Objective Caml, May 2003. Available from the author's web site.
21. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
22. Eugenio Moggi and Amr Sabry. An abstract monadic semantics for value recursion. In 2003 Workshop on Fixed Points in Computer Science, April 2003.
23. Aleksander Nanevski. Meta-programming with names and necessity. In 2002 International Conference on Functional Programming, pages 206-217, Pittsburgh, PA, 2002. A significant revision is available as a technical report CMU-CS-02-123R, Carnegie Mellon University.
24. Aleksandar Nanevski. A modal calculus for effect handling. Technical Report CMU-CS-03-149, Carnegie Mellon University, June 2003.
25. Objective Caml. http://www.ocaml.org.
26. Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998.
27. Andrew M. Pitts and Murdoch J. Gabbay. A metalanguages for programming with bound names modulo renaming. In Roland Backhouse and José Nuno Oliveira, editors, Mathematics of Program Construction, volume 1837 of Lecture Notes in Computer Science, pages 230-255. Springer, 2000.
28. Claudio V. Russo. Recursive structures for Standard ML. In International Conference on Functional Programming, pages 50-61, Florence, Italy, September 2001.
29. Jean-Pierre Talpin and Pierre Jouvelot. The type and effect discipline. Information and Computation, 111(2):245-296, 1994.
30. Mads Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, University of Edinburgh, 1988.
31. Andrew K. Wright. Simple imperative polymorphism. Lisp and Symbolic Computation, 8(4):343-355, 1995.