Combinators for program generation

Journal of Functional Programming

Volumn 9, Issue 5, 1999, Pages 483-525

  Thiemann, Peter ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000055491     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003469     Document Type: Article

References (63)

1. Andersen, L. O. (1994) Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen. (DIKU report 94/19.)
2. Beckman, L., Haraldsson, A., Oskarsson, Ö. and Sandewall, E. (1976) A partial evaluator, and its use as a programming tool. Artificial Intelligence, 7(4), 319-357.
3. Birkedal, L. and Welinder, M. (1993) Partial evaluation of Standard ML. Rapport 93/22, DIKU, University of Copenhagen.
4. Bondorf, A. (1991) Automatic autoprojection of higher order recursive equations. Science of Computer Programming, 17, 3-34.
5. Bondorf, A. (1992) Improving binding times without explicit CPS-conversion. Proc. 1992 ACM Conference on Lisp and Functional Programming, pp. 1-10. San Francisco, CA.
6. Bondorf, A. (1993) Similix 5.0 Manual. DIKU, University of Copenhagen.
7. Bondorf, A. and Dussart, D. (1994) Improving CPS-based partial evaluation: Writing cogen by hand. In: P. Sestoft and H. Sondergaard, editors, Proc. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation PEPM '94, pp. 1-10. Orlando, FL. (University of Melbourne, Australia. Technical Report 94/9, Department of Computer Science.)
8. Church, A. (1940) A formulation of the simple theory of types. J. Symbolic Logic, 5, 56-68.
9. Clément, D, Despeyroux, J., Despeyroux, T. and Kahn, G. (1986) A simple applicative language: Mini-ML. ACM Conference on LISP and Functional Programming, pp. 13-27.
10. Consel, C. and Danvy, O. (1993) Tutorial notes on partial evaluation. Proc. 20th Annual ACM Symposium on Principles of Programming Languages, pp. 493-501. Charleston, SC. ACM Press.
11. Consel, C. and Noël, F. (1996) A general approach for run-time specialization and its application to C. Proc. 23rd Annual ACM Symposium on Principles of Programming Languages, pp. 145-156. St. Petersburg, FL. ACM Press.
12. Danvy, O. and Filinski, A. (1990) Abstracting control. Proc. 1990 ACM Conference on Lisp and Functional Programming, pp. 151-160. Nice, France. ACM Press.
13. Danvy, O. and Filinski, A. (1992) Representing control: A study of the CPS transformation. Mathematical Structures in Coinput. Sci., 2, 361-391.
14. Danvy, O., Glück, R. and Thiemann, P. editors (1996) Dagstuhl Seminar on Partial Evaluation 1996: Lecture Notes in Computer Science 1110, Schloß Dagstuhl, Germany. Springer-Verlag.
15. Draves, S. (1996) Compiler generation for interactive graphics using intermediate code. In Danvy et al., editors, Dagstuhl Seminar on Partial Evaluation 1996: Lecture Notes in Computer Science 1110, pp. 95-114. Schloß Dagstuhl, Germany. Springer-Verlag.
16. Fegaras, L. and Sheard, T. (1996) Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space). Proc. 23rd Annual ACM Symposium on Principles of Programming Languages, pp. 284-294. St. Petersburg, FL. ACM Press.
17. Filinski, A. (1994) Representing monads. Proc. 21st Annual ACM Symposium on Principles of Programming Languages, pp. 446-457. Portland, OG. ACM Press.
18. Futamura, Y. (1971) Partial evaluation of computation process - an approach to a compiler-compiler. Systems, Computers, Controls, 2(5), 45-50.
19. Glück, R., and Jørgensen, J. (1995) Efficient multi-level generating extensions for program specialization. In: D. Swierstra and M. Hermenegildo, editors, International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP '95): Lecture Notes in Computer Science 982, pp. 259-278. Utrecht, The Netherlands. Springer-Verlag.
20. Glück, R., and J̈orgensen, J. (1996) Fast multi-level binding-time analysis for multiple program specialization. PSI-96: Andrei Ershov Second International Memorial Conference, Perspectives of System Informatics: Lecture Notes in Computer Science 1181, Novosibirsk, Russia. Springer-Verlag.
21. Gomard, C. K. (1990) Partial type inference for untyped functional programs. Proc. 1990 ACM Conference on Lisp and Functional Programming, pp. 282-287. Nice, France. ACM Press.
22. Gomard, C. K. (1992) A self-applicable partial evaluator for the lambda-calculus. ACM Trans. Programming Languages and Systems, 14(2), 147-172.
23. Gunter, C. A., Rémy, D. and Riecke, J. G. (1995) A generalization of exceptions and control in ML-like languages. In: S. Peyton Jones, editor, Proc. Functional Programming Languages and Computer Architecture 1995, pp. 12-23. La Jolla, CA. ACM Press.
24. Haskell 1.4, a non-strict, purely functional language (April 1997) http://haskell.systemsz.cs.yale.edu/onlinereport/.
25. Hatcliff, J. and Danvy, O. (1994) A generic account of continuation-passing styles. Proc. 21st Annual ACM Symposium on Principles of Programming Languages, pp. 458-471. Portland, OG. ACM Press.
26. Holstm C. K. (1989) Syntactic currying. Student report, DIKU, University of Copenhagen.
27. Hutton, G. (1992) Higher-order functions for parsing. J. Functional Programming, 2(3), 323-344.
28. Jones, N. D., Gomard, C. K. and Sestoft, P. (1993) Partial Evaluation and Automatic Program Generation. Prentice-Hall.
29. Jørgensen, J. and Leuschel, M. (1996) Efficiently generating efficient generating extensions in Prolog. In Danvy et al., editors, Dagstuhl Seminar on Partial Evaluation 1996: Lecture Notes in Computer Science 1110, pp. 238-262. Schloß Dagstuhl, Germany. Springer-Verlag.
30. 5 report on the algorithmic language Scheme. SIGPLAN Notices, 33(9), 26-76.
31. Kelsey, R. A. and Rees, J. A. (1995) A tractable Scheme implementation. Lisp and Symbolic Computation, 7(4), 315-335.
32. Launchbury, J. (1991) A strongly-typed self-applicable partial evaluator. In: J. Hughes, editor, Proc. Functional Programming Languages and Computer Architecture 1991: Lecture Notes in Computer Science 523, pp. 145-164. Cambridge, MA. Springer-Verlag.
33. Launchbury, J. and Holst, C. K. (1991) Handwriting cogen to avoid problems with static typing. Draft Proceedings, 4th Annual Glasgow Workshop on Functional Programming, pp. 210-218, Skye, Scotland.
34. Lawall, J. L. and Danvy, O. (1994) Continuation-based partial evaluation. Proc. 1994 ACM Conference on Lisp and Functional Programming, pp. 227-238, Orlando, FL. ACM Press.
35. Lawall, J. L. and Danvy, O. (1995) Continuation-based partial evaluation. Technical Report Technical Report CS-95-178, Brandeis University, Waltham, Massachusetts. (Extended version from ftp://ftp.brics.dk/pub/danvy/Papers/lawall-danvy-lfp94-extended.ps.gz.)
36. Leroy, X. (1997) The Objective Caml system release 1.07, Documentation and user's manual. INRIA, France. From http://pauillac.inria.fr/caml.
37. Proc. 1990 ACM Conference on Lisp and Functional Programming, Nice, France. ACM Press.
38. Mitchell, J. C. (1996) Foundations for Programming Languages. MIT Press.
39. Mogensen, T. Æ. (1992a) Efficient self-interpretation in lambda calculus. J. Functional Programming, 2(3), 345-364.
40. Mogensen, T. Æ. (1992b) Self-applicable partial evaluation for pure lambda calculus. In: C. Consel, editor, Proc. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation PEPM '92, pp. 116-121. San Francisco, CA. Yale University.
41. Mogensen, T. Æ. (1995) Self-applicable online partial evaluation of pure lambda calculus. In: W. Scherlis, editor, Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation PEPM '95, pp. 39-44. La Jolla, CA. ACM Press.
42. Moggi, E. (1988) Computational lambda-calculus and monads. Technical Report ECS-LFCS-88-86, University of Edinburgh.
43. Moggi, E. (1998) Functor categories and two-level languages. In: M. Nivat and A. Arnold, editors, Foundations of Software Science and Computation Structures. FoSSaCS'98: Lecture Notes in Computer Science, Lisbon, Portugal.
44. Mosses, P. D. (1990) Denotational Semantics, volume B of Handbook of Theoretical Computer Science, chapter 11. Elsevier.
45. Nielson, F. and Nielson, H. R. (1992) Two-Level Functional Languages, volume 34 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press.
46. Palsberg, J. (1993) Correctness of binding-time analysis. J. Functional Programming, 3(3), 347-364.
47. Pfenning, F. and Elliott, C. (1988) Higher-order abstract syntax. Proc. Conference on Programming Language Design and Implementation '88, pp. 199-208, Atlanta, GA. ACM Press.
48. Romanenko, S. A. (1988) A compiler generator produced by a self-applicable specializer can have a surprisingly natural and understandable structure. In: D. Bjorner, A. P. Ershov and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pp. 445-463. North-Holland.
49. Sabry, A. and Felleisen, M. (1993) Reasoning about programs in continuation-passing style. Lisp and Symbolic Computation, 6(3/4), 289-360.
50. Schmidt, D. A. (1986) Denotational Semantics, A Methodology for Software Development. Allyn and Bacon.
51. Sheard, T. and Fegaras, L. (1993) A fold for all seasons. In: Arvind, editor, Proc. Functional Programming Languages and Computer Architecture 1993, pp. 233-242. Copenhagen, Denmark. ACM Press.
52. Sperber, M. and Thiemann, P. (1995) The essence of LR parsing. In Scherlis, W., editor, Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation PEPM '95, pp. 146-155. La Jolla, CA. ACM Press.
53. Sperber, M. and Thiemann, P. (1997) Two for the price of one: Composing partial evaluation and compilation. Proc. of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation, pp. 215-225. Las Vegas, NV. ACM Press.
54. Taha, W. and Sheard, T. (1997) Multi-stage programming with explicit annotations. In: C. Consel, editor, Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation PEPM '97, pp. 203-217. Amsterdam, The Netherlands. ACM Press.
55. Thiemann, P. (1996a) Cogen in six lines. In: R. K. Dybvig, editor, Proc. International Conference on Functional Programming 1996, pp. 180-189. Philadelphia, PA. ACM Press.
56. Thiemann, P. (1996b) Implementing memoization for partial evaluation. In: H. Kuchen and D. Swierstra, editors, International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP '96): Lecture Notes in Computer Science 1140, pp. 198-212. Aachen, Germany. Springer-Verlag.
57. Thiemann, P. (1998) A generic framework for specialization. In: C. Hankin, editor, Proc. 7th European Symposium on Programming: Lecture Notes in Computer Science 1381, pp. 267-281. Lissabon, Portugal. Springer-Verlag.
58. Thiemann, P. (1999) The PGG System - User Manual. Universität Freiburg, Germany. (Available from http: //wwu.informatik.uni-freiburg.de/proglang/software/pgg/.
59. Thiemann, P. and Dussart, D. (1996) Partial evaluation for higher-order languages with state. Berichte des Wilhelm-Schickard-Instituts WSI-97-XX, Universität Tübingen.
60. Thiemann, P. and Glück, R. (1995) The generation of a higher-order online partial evaluator. In: M. Takeichi and T. Ida, editors, Fuji International Workshop on Functional and Logic Programming, pp. 239-253. World Scientific.
61. Thiemann, P. and Sperber, M. (1997) Program generation with class. In: M. Jarke, K. Pasedach and K. Pohl, editors, Proceedings Informatik'97, Reihe Informatik aktuell. Springer-Verlag.
62. Turchin, W. F. (1979) A supercompiler system based on the language Refal. SIGPLAN Notices, 14(2), 46-54.
63. Wand, M. (1982) Deriving target code as a representation of continuation semantics. ACM Trans. Programming Languages and Systems, 4(3), 496-517.