Check out the new USENIX Web site. next up previous
Next: About this document Up: DSL Implementation Using Staging Previous: Acknowledgments

References

1
Anders Bondorf and Jens Palsberg. Compiling actions by partial evaluation. In Conference on Functional Programming Languages and Computer Architecture, pages 308-320, New York, June 1993. ACM Press. Copenhagen.

2
Grady Campbell. Abstraction-based reuse repositories. Technical Report REUSE-REPOSITORIES-89041-N, Software Productivity Consortium Services Corporation, 2214 Rock Hill Road, Herndon, Virginia 22070, June 1989.

3
Grady Campbell, Stuart Faulk, and David Weiss. Introduction to Synthesis. Technical Report INTRO-SYNTHESIS-PROCESS-90019-N, Software Productivity Consortium Services Corporation, 2214 Rock Hill Road, Herndon, Virginia 22070, 1990.

4
Charles Consel and François Noël. A general approach for run-time specialization and its application to C. In Conference Record of POPL '96: The ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 145-156, St. Petersburg Beach, Florida, 21-24 January 1996.

5
O Danvy, J Koslowski, and K Malmkjaer. Compiling monads. Technical Report CIS-92-3, Kansas State University, Manhattan, Kansas, December 91.

6
Robert Glück and Jesper Jørgensen. Efficient multi-level generating extensions for program specialization. In S. D. Swierstra and M. Hermenegildo, editors, Programming Languages: Implementations, Logics and Programs (PLILP'95), volume 982 of Lecture Notes in Computer Science, pages 259-278. Springer-Verlag, 1995.

7
Mark P. Jones. A system of constructor classes: overloading and implicit higher-order polymorphism. In In FPCA '93: Conference on Functional Programming Languages and Computer Architecture, pages 52-64. ACM Press, 1993. (Appears, in extended form, in the Journal of Functional Programming, 5, 1, Cambridge University Press, January 1995.).

8
Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Series editor C. A. R. Hoare. Prentice Hall International, International Series in Computer Science, June 1993. ISBN number 0-13-020249-5 (pbk).

9
Paul Hudak Simon Peyton Jones, Philip Wadler, Brian Boutel, John Fairbairn, Joseph Fasel, Maria M. Guzman, Kevin Hammond, John Hughes, Thomas Johnsson, Dick Kieburtz, Rishiyur Nikhil, Will Partain, and John Peterson. Report on the programming language Haskell. SIGPLAN Notices, 27(5):Section R, 1992.

10
Peter Lee. Realistic Compiler Generation. Foundations of Computing Series. MIT Press, 1989.

11
Mark Leone and Peter Lee. A declarative approach to run-time code generation. In Workshop on Compiler Support for System Software (WCSSS), February 1996.

12
Sheng Liang and Paul Hudak. Modular denotational semantics for compiler construction. In ESOP'96: 6th European Symposium on Programming, number 1058 in LNCS, pages 333-343, Linkoping, Sweden, January 1996.

13
Sheng Liang, Paul Hudak, and Mark Jones. Monad transformers and modular interpreters. In ACM Symposium on Principles of Programming Languages, pages 333-343, San Francisco, California, January 1995.

14
P. Mosses. Denotational semantics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers B. V. (North-Holland), 1990.

15
Peter D. Mosses. SIS-semantics implementation system, reference manual and users guide. Technical Report DAIMI report MD-30, University of Aarhus, Aarhus, Denmark, 1979.

16
Peter D. Mosses. Action semantics. Cambridge Tracts in Theoretical Computer Science, (26), 1992.

17
Martin Odersky and Konstantin Läufer. Putting type annotations to work. In 23rd ACM Symposium on Principles of Programming Languages, St. Petersburg, Florida, January 1996.

18
L. Paulson. Methods and Tools for Compiler Construction, B. Lorho (editor). Cambridge University Press, 1984.

19
Lawrence Paulson. A sematics directed compiler generator. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 224-233. ACM, January 1982.

20
John Peterson, Kevin Hammond, et al. Report on the programming language haskell, a non-strict purely-functional programming language, version 1.3. Technical report, Yale University, May 1996.

21
Frank Pfenning, Joëlle Despeyroux, and Carsten Schürmann. Primitive recursion for higher-order abstract syntax. In Third International Conference on Typed Lambda Calculi and Applications (TLCA'97), pages 147-163, Nancy, France, April 1997.

22
Frank Pfenning, Gilles Dowek, Thérèse Hardin, and Claude Kirchner. Unification via explicit substitutions: The case of higher-order patterns. In Joint International Conference and Symposium on Logic Programming (JICSLP'96), Bonn, Germany, September 1996.

23
Calton Pu and Jonathan Walpole. A study of dynamic optimization techniques: Lessons and directions in kernel design. Technical Report OGI-CSE-93-007, Oregon Graduate Institute of Science and Technology, 1993.

24
Guy Steele. Building interpreters by composing monads. In 21st Annual ACM Symposium on Principles of Programming Languages (POPL'94), Portland, Oregon, January 1994.

25
Joseph E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. The MIT Press, Cambridge, Massachusetts, 1977.

26
Walid Taha, Zine-El-Abidine Benaissa, and Tim Sheard. Multi-stage programming: Axiomatization and type-safety. In 25th International Colloquium on Automata, Languages, and Programming, Aalborg, Denmark, 13-17July 1998.

27
Walid Taha and Tim Sheard. Multi-stage programming with explicit annotations. In Proceedings of the ACM-SIGPLAN Symposium on Partial Evaluation and semantic based program manipulations PEPM'97, Amsterdam, pages 203-217. ACM, 1997.

28
Philip Wadler. Comprehending monads. Proceedings of the ACM Symposium on Lisp and Functional Programming, Nice, France, pages 61-78, June 1990.

29
Philip Wadler. Comprehending monads. Proceedings of the ACM Symposium on Lisp and Functional Programming, Nice, France, pages 61-78, June 1990.

30
Philip Wadler. The essence of functional programming (invited talk). In 19'th ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, January 1992.

31
Philip Wadler. Monads for functional programming. In J. Jeuring and E. Meijer, editors, Advanced Functional Programming, volume 925 of LNCS. Springer Verlag, 1995.

32
Tanya Widen. Formal language design in the context of domain engineering. Master's thesis, Department of Computer Science and Engineering, Oregon Graduate Institute, October 1997.

33
Tanya Widen and James Hook. Software design automation: Language design in the context of domain engenieering. In The 10th International Conference on Software Engineering & Knowledge Engineering (SEKE'98), pages 308-317, San Francisco Bay, California, June 1998.


Zine-El-abidine Benaissa
Wed Jul 21 11:46:59 PDT 1999