Manuel Serrano
- 1.J.F. Bartlett. Scheme->C a Portable Scheme-to-C Compiler. Research Report 89 1, DEC Western Research Laboratory, Palo Alto, California, January 1989.Google Scholar
- 2.P.H. Hartel, H. Glase, and J.M. Wild. Compilation of Functional Languages Using Flow Graph Analysis. Software ~ Practice and Experience, 24(2):127-173, February 1994. Google ScholarDigital Library
- 3.T. Johnson. Lambda Lifting: Transforming Programs to Recursire Equations. In Proceedings of the A CM Conference on Conference on Functional Programming Languages and Computer Architecture, pages 190-203, 1985. Google ScholarDigital Library
- 4.D. Kranz, R. Kesley, J. Rees, P. Hudak, J. Philbin, and N. Adams. ORBIT: An optimizing compiler for Scheme. In Symposium on Compiler Construction, pages 219-233, Palo Alto, California, June 1986. ACM. Google ScholarDigital Library
- 5.D.A. Kranz. ORBIT: An Optimizing Compiler For Scheme. PhD thesis, Yale university, February 1988. Google ScholarDigital Library
- 6.G.J. Rozas. Taming the Y operator. In Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming, pages 226-234. ACM, June 1992. Google ScholarDigital Library
- 7.N. S6niak. Thiorie et pratique de Sqil: un langage intermidi. aire pour la compilation des iangages fonctionnels. PhD thesis, Universit6 Pierre et Marie Curie (Paris VI), November 1991.Google Scholar
- 8.M. Serrano. Bigloo user's manual. Technical Report to appear, INRIA-Racquencourt, France, 1994.Google Scholar
- 9.O. Shivers. Control flow analysis in scheme. In Conference on Programming Language Design and Implementation, Atlanta, Georgia, June 1988. Google ScholarDigital Library
- 10.O. Shivers. Control-Flow Analysis of Higher-Order Languages or Taming Lambda. CMU-CS-91-145, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, May 199I.Google Scholar
Index Terms
- Control flow analysis: a functional languages compilation paradigm
Recommendations
A polymorphic modal type system for lisp-like multi-staged languages
POPL '06: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languagesThis article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-quotation system). The combination is meaningful because ML is a practical ...
A polymorphic modal type system for lisp-like multi-staged languages
Proceedings of the 2006 POPL ConferenceThis article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-quotation system). The combination is meaningful because ML is a practical ...
Comments