Polymorphic typed defunctionalization

ACM SIGPLAN Notices

Volumn 39, Issue 1, 2004, Pages 89-98

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

^a INRIA   (France)

Author keywords

Closure conversion; Defunctionalization; Polymorphism; Type preservation

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; PROGRAM COMPILERS; PROGRAM DIAGNOSTICS; SEMANTICS;

CLOSURE CONVERSION; DEFUNCTIONALIZATION; POLYMORPHISM;

PROGRAMMING THEORY;

EID: 1442263161     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/982962.964009     Document Type: Conference Paper

References (18)

1. Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. Design and correctness of program transformations based on control-flow analysis. In International Symposium on Theoretical Aspects of Computer Software (TACS), volume 2215 of Lecture Notes in Computer Science, pages 420-447. Springer Verlag, October 2001. URL: http://www.cis.ksu.edu/~ab/Publications/pcfa.ps.gz.
2. Jeffrey M. Bell, Françoise Bellegarde, and James Hook. Type-driven defunctionalization. In ACM International Conference on Functional Programming (ICFP), August 1997. URL: http://doi.acm.org/10.1145/258949.258953.
3. Henry Cejtin, Suresh Jagannathan, and Stephen Weeks. Flow-directed closure conversion for typed languages. In European Symposium on Programming (ESOP), volume 1782 of Lecture Notes in Computer Science, pages 56-71. Springer Verlag, March 2000. URL: http://www.mlton.org/papers/00-esop.ps.gz.
4. James Cheney and Ralf Hinze. First-class phantom types. Technical Report 1901, Cornell University, 2003. URL: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/ cul.cis/TR2003-1901.
5. Olivier Danvy. Functional unparsing. Journal of Functional Programming, 8(6):621-625, November 1998.
6. Olivier Danvy and Lasse R. Nielsen. Defunctionalization at work. In ACM International Conference on Principles and Practice of Declarative Programming (PPDP), pages 162-174, September 2001.
7. Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The essence of compiling with continuations. In ACM Conference on Programming Language Design and Implementation (PLDI), pages 237-247, 1993. URL: http://www.cs.rice.edu/CS/PLT/Publications/Scheme/pldi93-fsdf.ps.gz.
8. Yasuhiko Minamide, Greg Morrisett, and Robert Harper. Typed closure conversion. In ACM Symposium on Principles of Programming Languages (POPL), pages 271-283, January 1996. URL: http://www.cs.cornell.edu/Info/People/jgm/papers/closure-summary.ps.
9. Greg Morrisett and Robert Harper. Typed closure conversion for recursively-defined functions (extended abstract). In International Workshop on Higher Order Operational Techniques in Semantics (HOOTS), volume 10 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 1998. URL: http://www.cs.cornell.edu/home/jgm/papers/hootsclosure.ps.
10. Greg Morrisett, David Walker, Karl Crary, and Neal Glew. From system F to typed assembly language. ACM Transactions on Programming Languages and Systems, 21(3):528-569, May 1999. URL: http://www.cs.cornell.edu/talc/papers/tal-toplas.pdf.
11. Lasse R. Nielsen. A denotational investigation of defunctionalization. Technical Report RS-00-47, BRICS, December 2000. URL: http://www.bricks.dk/RS/00/47.
12. Christine Paulin-Mohring. Inductive definitions in the system coq: Rules and properties. Research Report RR1992-49, ENS Lyon, 1992. URL: ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR1992/RR1992-49.ps.Z.
13. John C. Reynolds. Definitional interpreters for higher-order programming languages. Higher-Order and Symbolic Computation, 11(4):363-397, December 1998. URL: ftp://ftp.cs.cmu.edu/user/jcr/defint/dvi.gz.
14. John C. Reynolds. Definitional interpreters revisited. Higher Order and Symbolic Computation, 11(4):355-361, December 1998. URL: ftp://ftp.cs.cmu.edu/user/jcr/defintintro.dvi.gz.
15. Andrew Tolmach. Combining closure conversion with closure analysis using algebraic types. In Workshop on Types in Compilation (TIC), June 1997. URL: http://www.cs.pdx.edu/~apt/tic97.ps.
16. Andrew Tolmach and Dino P. Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. Journal of Functional Programming, 8(4):367-412, July 1998. URL: http://www.cs.pdx.edu/~apt/jfp98.ps.
17. Hongwei Xi. Dead code elimination through dependent types. In International Workshop on Practical Aspects of Declarative Languages (PADL), volume 1551 of Lecture Notes in Computer Science, pages 228-242. Springer Verlag, January 1999. URL: http://www.cs.bu.edu/~hwxi.academic/papers/padl99.ps.
18. Hongwei Xi, Chiyan Chen, and Gang Chen. Guarded recursive datatype constructors. In ACM Symposium on Principles of Programming Languages (POPL), January 2003. URL: http://www.cs.bu.edu/fac.hwxi/academic/papers/pop103.ps.