MetaML and multi-stage programming with explicit annotations

Theoretical Computer Science

Volumn 248, Issue 1-2, 2000, Pages 211-242

  Taha, Walid ^a   Sheard, Tim ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

Functional programming; High level program generation; Multi level languages; Multi stage languages; Programming language semantics; Type safety; Type systems; Calculus

Indexed keywords

EID: 0013091874     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00053-0     Document Type: Article

References (50)

1. C. Consel, O. Danvy, Tutorial notes on partial evaluation, ACM Symp. on Principles of Programming Languages, January 1993, pp. 493-501.
2. C. Consel, F. Noël, A general approach for run-time specialization and its apllication to C, Conf. Record of POPL '96: The 23rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, St. Petersburg Beach, Florida, 21-24 January 1996, pp. 145-156.
3. O. Danvy, Across the bridge between reflection and partial evaluation, in: D. Bjorner, A.P. Ershov, N.D. Jones (Eds.), Partial Evaluation and Mixed Computation, North-Holland, Amsterdam, 1988, pp. 83-116.
4. O. Danvy, Type-directed partial evaluation, ACM Symp. on Principles of Programming Languages, Florida, ACM, New York, January 1996, pp. 242-257.
5. O. Danvy, K. Malmkjaer, J. Palsberg, The essence of eta-expansion in partial evaluation, LISP Symbolic Comput. 1 (19) (1995).
6. R. Davies, A temporal-logic approach to binding-time analysis, Proc. 11th Ann. IEEE Symp. on Logic in Computer Science, New Brunswick, New Jersey, 27-30 July, IEEE Computer Society Press, Silverspring, MD, 1996, pp. 184-195.
7. R. Davies, F. Pfenning, A Modal Analysis of Staged Computation, 23rd Ann. ACM Symp. on Principles of Programming Languages (POPL'96), St.Petersburg Beach, Florida, January 1996.
8. R. Glück, J. Jørgensen, Efficient multi-level generating extensions for program specialization, in: S.D. Swierstra, M. Hermenegildo (Eds.), Programming Languages: Implementations, Logics and Programs (PLILP'95), Lecture Notes in Computer Science, Vol. 982, Springer, Berlin, 1995, pp. 259-278.
9. R. Glück, J. Jørgensen, in: Efficient multi-level generating extensions for program specialization, Programming Languages, Implementations, Logics and Programs (PLILP'95), Lecture Notes in Computer Science, Vol. 982, Springer, Berlin, 1995.
10. R. Glück, J. Jørgensen, in: Fast binding-time analysis for multi-level specialization, PSI-96: Andrei Ershov 2nd International Memorial Conf, Perspectives of System Informatics, Lecture Notes in Computer Science, Vol. 1181, Springer, Berlin, 1996.
11. C.K. Gomard, N.D. Jones, A partial evaluator for untyped lambda calculus, J. Funct. Programm. 1 (1) (1991) 21-69.
12. B. Grant, M. Mock, M. Philipose, C. Chambers, S.J. Eggers, Annotation-directed run-time Specialization in C, Proc. ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation, Amsterdam, The Netherlands, June 1997, pp. 163-178.
13. J. Hatcliff, R. Glück, Reasoning about hierarchies of online specialization systems, in: O. Danvy, R. Glück (Eds.), Partial Evaluation, Lecture Notes in Computer Science, Vol. 1110, Springer, Berlin, 1996, pp. 161-182.
14. F. Henglein, C. Mossin, Polymorphic binding-time analysis, in: D. Sannella (Ed.), Programming Languages and Systems - ESOP'94 5th European Symp. on Programming, Lecture Notes in Computer Science, Vol. 788, Edinburgh, U.K., Springer, Berlin, April 1994, pp. 287-301.
15. J. Hook, T. Sheard, A semantics of compile-time reflection, Tech. Rep. CSE 93-019, Oregon Graduate Institute, 1993.
16. L. Hornof, C. Consel, J. Noyé, Effective specialization of realistic programs via use sensitivity, SAS 1997, Paris, France, September 1997, pp. 293-314.
17. L. Hornof, J. Noyé, Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity, Proc. ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation, Amsterdam, The Netherlands, 12-13 June 1997, pp. 63-73.
18. N.D. Jones, Mix ten years later, in: Partial Evaluation and Semantics-Based Program Manipulation, New Haven, Connecticut (Sigplan Notices, Vol. 26, no. 9, September 1991) ACM, New York, June 1995, pp. 24-38.
19. N.D. Jones, What not to do when writing an interpreter for specialisation, in: O. Danvy, R. Glück (Eds.), Partial Evaluation, Lecture Notes in Computer Science, Vol. 1110, Springer, Berlin, 1996, pp. 216-237.
20. N.D. Jones, C.K. Gomard, P. Sestoft, Partial Evaluation and Automatic Program Generation, Prentice-Hall, Englewood cliffs, NJ, 1993.
21. S.L.P. Jones, J. Launchbury, Unboxed values as first class citizens in a non-strict functional language, in: Functional Programming and Computer Architecture, September 1991.
22. R.B. Kieburtz, F. Bellegarde, J. Bell, J. Hook, J. Lewis, D. Oliva, T. Sheard, L. Walton, T. Zhou, Calculating software generators from solution specifications, TAPSOFT'95, Lecture Notes in Computer Science, Vol. 915, Springer, Berlin, 1995, pp. 546-560.
23. R.B. Kieburtz, L. McKinney, J. Bell, J. Hook, A. Kotov, J. Lewis, D. Oliva, T. Sheard, I. Smith, L. Walton, A software engineering experiment in software component generation, in: 18th Internat. Conf. in Software Engineering, March 1996.
24. M. Leone, P. Lee, Deferred compilation: the automation of run-time code generation, Tech. Rep. CMU-CS-93-225, Carnegie Mellon University, December 1993.
25. M. Leone, P. Lee, A declarative approach to run-time code generation, Workshop on Compiler Support for System Software (WCSSS), February 1996.
26. M. Lowry, A. Philpot, T. Pressburger, I. Underwood, Amphion: automatic programming for scientific subroutine libraries, NASA Sci. Inform. Systems Newslett. 31 (1994) 22-25.
27. R. Milner, A theory of type polymorphism in programming, J. Comput. System Sci. 17 (1978) 348-375.
28. E. Moggi, A categorical account of two-level languages, In MFPS 1997, 1997.
29. E. Moggi, W. Taha, Z. Benaissa, T. Sheard, An idealized MetaML: Simpler, and more expressive (includes Proofs), Tech. Rep. CSE-98-017, OGI, October 1998.
30. F. Nielson, Program transformations in a denotational setting, ACM Trans. Programm. Languages Systems 7 (3) (1985) 359-379.
31. F. Nielson, Correctness of code generation from a two-level meta-language, in: B. Robinet, R. Wilhelm (Eds.), Proc. European Symp. on Programming (ESOP 86), Lecture Notes in Computer Science, Vol. 213, Saarbrücken, FRG, March 1986, Springer, Berlin, pp. 30-40.
32. F. Nielson, Two-level semantics and abstract interpretation, Theoret. Comput. Sci. 69 (2) (1989) 117-242.
33. F. Nielson, H.R. Nielson, Two-level semantics and code generation, Theoret. Comput. Sci. 56 (1) (1988) 59-133.
34. F. Nielson, H.R. Nielson, Two-Level Functional Languages, Cambridge Tracts in Theoretical Computer Science, Vol. 34, Cambridge University Press, Cambridge, 1992.
35. F. Nielson, H.R. Nielson, Multi-level lambda-calculi: an algebraic description, in: O. Danvy, R. Glück (Eds.), Partial Evaluation. Dagstuhl Castle, Germany, February 1996, Lecture Notes in Computer Science, Vol. 1110, Springer, Berlin, 1996, pp. 338-354.
36. F. Nielson, H.R. Nielson, A prescriptive framework for designing multi-level lambda-calculi, Proc. Symp. on Partial Evaluation and Semantics-Based Program Manipulation, Amsterdam, June 1997.
37. C. Pu, J. Walpole, A study of dynamic optimization techniques: lessons and directions in kernel design, Tech. Rep. OGI-CSE-93-007, Oregon Graduate Institute of Science and Technology, 1993.
38. T. Sheard, A user's guide to trpl, a compile-time reflective programming language, Tech. Rep. COINS Tech. Rep. 90-109, Dept. of Computer and Information Science, University of Massachusetts, 1990.
39. T. Sheard, Automatic generation and use of abstract structure operators, ACM Trans. Programm. Languages and Systems 13 (4) (1991) 531-557.
40. T. Sheard, Guide to using crml, cmopile-time reflective ml. (Available from author's home-page), October 1993.
41. T. Sheard, Type parametric programming, Tech. Rep. CSE 93-018, Oregon Graduate Institute, 1993.
42. T. Sheard, A type-directed, on-line partial evaluator for a polymorphic language, in: Proc. Symp. on Partial Evaluation and Semantics-Based Program Manipulation, Amsterdam, June 1997.
43. T. Sheard, N. Nelson, Type safe abstractions using program generators, Tech. Rep. OGI-TR-95-013, Oregon Graduate Institute of Science and Technology, 1995.
44. M. Shields, T. Sheard, S.P. Jones, Dynamic typing through staged type inference, in: Proc. 25th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, January 1998.
45. B.C. Smith, Reflection and semantics in a procedural language, Ph.D. Thesis, Massachusetts Institute of Technology, January 1982.
46. B.C. Smith, Reflection and semantics in lisp, ACM Symp. on Principles of Programming Languages, January 1984.
47. D. Stemple, R.B. Stanton, T. Sheard, P. Philbrow, R. Morrison, G.N.C. Kirby, L. Fegaras, R.L. Cooper, R.C.H. Connor, M.P. Atkinson, S. Alagic, Type-safe linguistic reflection: a generator technology, Tech. Rep. FIDE/92/49, ESPRIT BRA Project 3070 FIDE, 1992.
48. W. Taha, Z. Benaissa, T. Sheard, Multi-stage programming: axiomatization and type-safety, 25th ICALP, Aalborg, Denmark, July 1998.
49. W. Taha, T. Sheard, Multi-stage programming with explicit annotations, Proc. ACM-SIGPLAN Symp. on Partial Evaluation and semantic based program manipulations PEPM'97, Amsterdam, ACM, New York, 1997, pp. 203-217.
50. P. Thiemann, Towards partial evaluation of full Scheme, in: G. Kiczales (Ed.), Reflection 96, San Francisco, CA, USA, April 1996, pp. 95-106.