Polymorphic typed defunctionalization and concretization

Higher-Order and Symbolic Computation

Volumn 19, Issue 1, 2006, Pages 125-162

  Pottier, François ^a   Gauthier, Nadji ^a  

^a INRIA   (France)

Author keywords

Closure conversion; Concretization; Defunctionalization; Dictionary records; Polymorphic records; Polymorphism; Type classes; Type preserving compilation

Indexed keywords

DATA PROCESSING; MATHEMATICAL TRANSFORMATIONS; NUMERICAL METHODS; PROGRAM COMPILERS; RECORDS MANAGEMENT;

CLOSURE CONVERSION; CONCRETIZATION; DEFUNCTIONALIZATION; DICTIONARY RECORDS; POLYMORPHIC RECORDS; POLYMORPHISM; TYPE CLASSES; TYPE-PRESERVING COMPILATION;

FUNCTION EVALUATION;

EID: 33745893774     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10990-006-8611-7     Document Type: Article

References (46)

1. Banerjee, A., Heintze, N., Riecke, J.G.: Design and correctness of program transformations based on control-flow analysis. In: International Symposium on Theoretical Aspects of Computer Software (TACS), vol. 2215 of Lecture Notes in Computer Science, pp. 420-447 (2001)
2. Bell, J.M., Bellegarde, F., Hook, J.: Type-driven defunctionalization. In: ACM International Conference on Functional Programming (ICFP) (1997)
3. Bonniot, D.: Type-checking multi-methods in ML (a modular approach). In: Workshop on Foundations of Object-Oriented Languages (FOOL) (2002)
4. Boquist, U.: Code optimisation techniques for lazy functional languages. Ph.D. thesis, Chalmers University of Technology (1999)
5. Bourdoncle, F., Merz, S.: Type checking higher-order polymorphic multi-methods. In: ACM Symposium on Principles of Programming Languages (POPL), pp. 302-315 (1997)
6. Cardelli, L.: A semantics of multiple inheritance. Information and Computation 76(2/3), 138-164 (1988)
7. Cejtin, H., Jagannathan, S., Weeks, S.: Flow-directed closure conversion for typed languages. In: European Symposium on Programming (ESOP), vol. 1782 of Lecture Notes in Computer Science, pp. 56-71 (2000)
8. Cheney, J., Hinze, R.: First-class phantom types. Technical Report 1901, Cornell University (2003)
9. Damas, L., Milner, R.: Principal type-schemes for functional programs. In: ACM Symposium on Principles of Programming Languages (POPL), pp. 207-212 (1982)
10. Danvy, O.: Functional unparsing. Journal of Functional Programming 8(6), 621-625 (1998)
11. Danvy, O., Nielsen, L.R.: Defunctionalization at work. In: ACM International Conference on Principles and Practice of Declarative Programming (PPDP), pp. 162-174 (2001)
12. Frey, A.: Approche algébrique du typage d'un langage à la ML avec objets, sous-typage et multi-méthodes. Ph.D. thesis, École des Mines de Paris (2004)
13. Furuse, J.: Extensional polymorphism by flow graph dispatching. In: Asian Symposium on Programming Languages and Systems, vol. 2895 of Lecture Notes in Computer Science (2003)
14. Gaster, B.R., Jones, M.P.: A polymorphic type system for extensible records and variants. Technical Report NOTTCS-TR-96-3, Department of Computer Science, University of Nottingham (1996)
15. Girard, J.-Y.: Interprétation fonctionnelle et élimination des coupures de larithmétique dordre supérieur. Thése d'état, Université Paris 7 (1972)
16. Hall, C., Hammond, K., Peyton Jones, S., Wadler, P.: Type classes in Haskell. In: Sannella D. (ed.): European Symposium on Programming (ESOP), vol. 788 of Lecture Notes in Computer Science, pp. 241-256 (1994)
17. Hall, C., Hammond, K., Peyton Jones, S., Wadler, P.: Type classes in Haskell. ACM Transactions on Programming Languages and Systems 18(2), 109-138 (1996)
18. Hanus, M.: Horn clause specifications with polymorphic types. Ph.D. thesis, Fachbereich Informatik, Universität Dortmund (1988)
19. Hanus, M.: Horn clause programs with polymorphic types: Semantics and resolution. In: International Joint Conference on Theory and Practice of Software Development (TAPSOFT), vol. 352 of Lecture Notes in Computer Science, pp. 225-240 (1989)
20. Hinze, R.: Fun with phantom types. In: Gibbons J., de Moor O. (eds.) The Fun of Programming. Palgrave Macmillan, pp. 245-262 (2003)
21. Millstein, T., Chambers, C.: Modular statically typed multimethods. Information and Computation 175(1), 76-118 (2002)
22. Milner, R.: A theory of type polymorphism in programming. Journal of Computer and System Sciences 17(3), 348-375 (1978)
23. Minamide, Y., Morrisett, G., Harper, R.: Typed closure conversion. In: ACM Symposium on Principles of Programming Languages (POPL), pp. 271-283 (1996)
24. Morrisett, G., Harper, R.: Typed closure conversion for recursively-defined functions (extended abstract). In: International Workshop on Higher Order Operational Techniques in Semantics (HOOTS), vol. 10 of Electronic Notes in Theoretical Computer Science (1998)
25. Morrisett, G., Walker, D., Crary, K., Glew, N.: From system F to typed assembly language. ACM Transactions on Programming Languages and Systems 21(3), 528-569 (1999)
26. Nielsen, L.R.: A denotational investigation of defunctionalization. Technical Report RS-00-47, BRICS (2000)
27. Ohori, A.: A polymorphic record calculus and its compilation. ACM Transactions on Programming Languages and Systems 17(6), 844-895 (1995)
28. Paulin-Mohring, C.: Inductive definitions in the system Coq: rules and properties. Research Report RR1992-49, ENS Lyon (1992)
29. Pierce, B.C.: Types and Programming Languages. MIT Press, (2002)
30. Pottier, F., Gauthier, N.: Polymorphic typed defunctionalization. In: ACM Symposium on Principles of Programming Languages (POPL), pp. 89-98 (2004)
31. Pottier, F., Rémy, D.: The essence of ML type inference. In: Pierce B. C. (ed.), Advanced Topics in Types and Programming Languages. MIT Press, Chapt. 10, pp. 389-489 (2005)
32. Rémy, D.: Type inference for records in a natural extension of ML. In: Gunter C. A., Mitchell J. C. (eds), Theoretical Aspects of Object-Oriented Programming. Types, Semantics and Language Design. MIT Press (1994)
33. Reynolds, J.C.: Types, abstraction and parametric polymorphism. In: Information Processing vol. 83, pp. 513-523 (1983)
34. Reynolds, J.C.: Definitional interpreters for higher-order programming languages. Higher-Order and Symbolic Computation 11(4), 363-397 (1998)
35. Reynolds, J.C.: Definitional interpreters revisited. Higher-Order and Symbolic Computation 11(4), 355-361 (1998)
36. Sheard, T.: Languages of the future. In: ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pp. 116-119 (2004)
37. Simonet, V., Pottier, F.: Constraint-based type inference for guarded algebraic data types. Research Report 5462, INRIA (2005)
38. Tolmach, A.: Combining closure conversion with closure analysis using algebraic types. In: Workshop on Types in Compilation (TIC) (1997)
39. Tolmach, A., Oliva, D.P.: From ML to Ada: Strongly-typed language interoperability via source translation. Journal of Functional Programming 8(4), 367-412 (1998)
40. Wadler, P., Blott, S.: How to make ad-hoc polymorphism less ad-hoc. In: ACM Symposium on Principles of Programming Languages (POPL), pp. 60-76 (1989)
41. Warren, D.H.D.: Higher-order extensions to PROLOG: are they needed?. In: Hayes J. E., Michie D., Pao Y.-H. (eds.) Machine Intelligence 10. Ellis Horwood, pp. 441-454 (1982)
42. Xi, H.: Dead code elimination through dependent types. In: International Workshop on Practical Aspects of Declarative Languages (PADL), vol. 1551 of Lecture Notes in Computer Science, pp. 228-242 (1999)
43. Xi, H.: Applied type system. In: TYPES 2003, vol. 3085 of Lecture Notes in Computer Science, pp. 394-408 (2004)
44. Xi, H., Chen, C., Chen, G.: Guarded recursive datatype constructors. In: ACM Symposium on Principles of Programming Languages (POPL), pp. 224-235 (2003)
45. Zendra, O., Colnet, D., Collin, S.: Efficient dynamic dispatch without virtual function tables, the Small-Eiffel compiler. In: ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pp. 125-141 (1997)
46. Zibin, Y., Gil, Y.: Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching. In: ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pp. 142-160 (2002)