Recursive type generativity

Journal of Functional Programming

Volumn 17, Issue 4-5, 2007, Pages 433-471

  Dreyer, Derek ^a  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT TYPES; EXISTENTIAL TYPES; GENERATIVITY; MODULE SYSTEMS; RECURSIONS; RECURSIVE TYPES; STANDARD ML;

SEMANTICS;

ABSTRACT DATA TYPES;

EID: 34547815644     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796807006429     Document Type: Conference Paper

References (36)

1. Amadio, R. & Cardelli, L. (1993) Subtyping recursive types. ACM Trans. Program. Lang. Syst. 15(4), 575-631.
2. Ancona, D. & Zueca, E. (1999) A primitive calculus for module systems. In International Conference on Principles and Practice of Declarative Programming (PPDP). Lecture Notes in Computer Science, vol. 1702. London, UK: Springer-Verlag, pp. 62-79.
3. Benton, N. & Leperchey, B. (2005) Relational reasoning in a nominal semantics for storage. In International Conference on Typed Lambda Calculi and Applications (TLCA), pp. 86-101.
4. Bohr, N. & Birkedal, L. (2006) Relational reasoning for recursive types and references. In Asian Symposium on Programming Languages and Systems (APLAS), pp. 79-96.
5. Crary, K., Harper, R. & Puri, S. (1999) What is a recursive module? In ACM Conference on Programming Language Design and Implementation (PLDI), pp. 50-63.
6. Dreyer, D. (2004) A type system for well-founded recursion. In ACM Symposium on Principles of Programming Languages (POPL), pp. 293-305.
7. Dreyer, D. (2005a) Recursive type generativity. In International Conference on Functional Programming (ICFP), pp. 41-53.
8. Dreyer, D. (2005b) Understanding and Evolving the ML Module System, Ph.D. thesis. Pittsburgh, PA: Carnegie Mellon University.
9. Dreyer, D. (2006) Practical Type Theory for Recursive Modules, Tech. rept. TR-2006-07. Department of Computer Science, University of Chicago.
10. Dreyer, D. & Blume, M. (2007) Principal type schemes for modular programs. In European Symposium on Programming (ESOP). pp. 441-457.
11. Dreyer, D., Crary, K. & Harper, R. (2003) A type system for higher-order modules. In ACM Symposium on Principles of Programming Languages (POPL). pp. 236-249.
12. Duggan, D. (2002) Type-safe linking with recursive DLL's and shared libraries. ACM Trans. Program. Lang. Syst., 24(6), 711-804
13. Flatt, M. (2005) PLT MzScheme: Language Manual. Available at: www.plt-scheme.org.
14. Flatt, M. & Felleisen, M. (1998) Units: Cool modules for HOT languages. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 236-248.
15. Gifford, D. K. & Lucassen, J. M. (1986) Integrating functional and imperative programming. ACM Conference on LISP and Functional Programming, pp. 28-38.
16. Harper, R. & Stone, C. (2000) A type-theoretic interpretation of Standard. ML. In Plotkin, G., Stirling, C. & Tofte, M. (eds) Proof, Language, and Interaction: Essays in Honor of Robin Milner. Cambridge, MA: MIT Press, pp. 341-387.
17. Jones, M. P. (1996) Using parameterized signatures to express modular structure. In ACM Symposium on Principles of Programming Languages (POPL), pp. 68-78.
18. Koutavas, V. & Wand, M. (2006) Small bisimulations for reasoning about higher-order imperative programs. ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), pp. 141-152.
19. Leroy, X. (1995) Applicative functors and fully transparent higher-order modules. ACM SIGPLAN Symposium on Principles of Programming Languages (POPL) pp. 142-153.
20. Leroy, X. (2003) A Proposal for Recursive Modules in Objective Caml. Available from the author's website.
21. Leroy, X. (2004) The Objective Caml System: Documentation and User's Manual. Available at: www.ocaml.org.
22. Milner, R., Tofte, M., Harper, R. & MacQueen, D. (1997) The Definition of Standard ML (Revised). Cambridge, MA: MIT Press.
23. Mitchell, J. C. (1996) Foundations for Programming Languages. Cambridge, MA: MIT Press.
24. 3: A linear language with locations. In International Conference on Typed Lambda Calculi and Applications (TLCA), pp. 293-307.
25. Okasaki, C. (1998) Purely Functional Data Structures. Cambridge, UK: Cambridge University Press.
26. Pitts, A. (2005) Typed operational reasoning. In Advanced Topics in Types and Programming Languages, Pierce, B. C. (ed). Cambridge, MA: MIT Press, chap. 7.
27. Romanenko, S., Russo, C. & Sestoft, P. (2000) Moscow ML Language Overview. Available at : www.dina.kvl.dk/~sestoft/mosml.html.
28. Rossberg, A. (2003) Generativity and dynamic opacity for abstract types. In International Conference on Principles and Practice of Declarative Programming (PPDP). pp. 241-252.
29. Russo, C. V. (2001) Recursive structures for Standard ML. In International Conference on Functional Programming (ICFP), pp. 50-61.
30. Stone, C. A. (2005) Type definitions. In Advanced Topics in Types and Programming Languages Pierce, B. C. (ed). Cambridge, MA: MIT Press, chap. 9.
31. Stone, C. A. & Harper, R. (2006) Extensional equivalence and singleton types. ACM Trans. Comput. Logic, 7(4), 676-722.
32. Talpin, J.-P. & Jouvelot, P. (1994) The type and effect discipline. Inf. Comput. 111(2), 245-296.
33. Vanderwaart, J. C., Dreyer, D., Petersen, L., Crary, K., Harper, R. & Cheng, P. (2003) Typed compilation of recursive datatypes. In ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI). pp. 98-108.
34. Wadler, P. (1985) Listlessness is Better than Laziness, Ph.D. thesis. Pittsburgh, PA: Carnegie Mellon University.
35. Wadler, P. (1990) Linear types can change the world! In IFIP TC 2 Working Conference on Programming Concepts and Methods, pp. 347-359.
36. Walker, D., Crary, K. & Morrisett, G. (2000) Typed memory management via static capabilities. ACM Trans. Program. Lang. Syst. 22(4), 701-771.