Search-based binding time analysis using type-directed pruning

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue SEP., 2002, Pages 20-31

  Sheard, Tim ^a   Linger, Nathan ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

Binding time analysis; Staging; Type directed search

Indexed keywords

ALGORITHMS; AUTOMATIC PROGRAMMING; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; PROGRAM PROCESSORS;

BINDING TIME ANALYSIS; TIME DIRECTED SEARCH;

PROGRAM DIAGNOSTICS;

EID: 0036949170     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/568173.568176     Document Type: Conference Paper

References (26)

1. J. M. Ashley and C. Consel. Fixpoint computation for polyvariant static analyses of higher-order applicative programs. ACM Transactions on Programming Languages and Systems, 16(5):1331-1448, Sept. 1994.
2. A. Bondorf. Automatic autoprojection of higher order recursive equations. In N. D. Jones, editor, ESOP '90. 3rd European Symposium on Programming, Copenhagen, Denmark, May 1990 (Lecture Notes in Computer Science, vol. 432), pages 70-87. Berlin: Springer-Verlag, May 1990.
3. A. Bondorf. Self-Applicable Partial Evaluation (Revised Version). PhD thesis, DIKU, University of Copenhagen, Denmark, Dec. 1990. DIKU-report 90/17.
4. R. S. Boyer and J. S. Moore. A Computational Logic. Academic Press, New York, 1979.
5. C. Consel. Binding time analysis for higher order untyped functional languages. In 1990 ACM Conference on Lisp and Functional Programming, pages 264-272. ACM, ACM Press, June 1990.
6. C. Consel. Polyvariant binding-time analysis for applicative languages. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 66-77, Copenhagen, Denmark, 14-16 June 1993.
7. D. Dussart, E. Bevers, and K. D. Vlaminck. Polyvariant constructor specialisation. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 54-65, La Jolla, California, 21-23 June 1995.
8. R. Glück and J. 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.
9. R. Glück and J. Jørgensen. An automatic program generator for multi-level specialization. Lisp and Symbolic Computation, 10(2):113-158, July 1997.
10. R. Glueck and J. Joergensen. Efficient multi-level generating extensions. Lecture Notes in Computer Science, 982:259-278, 1995.
11. C. K. Gomard and N. D. Jones. A partial evaluator for untyped lambda calculus. Journal of Functional Programming, 1(1):21-69, 1991.
12. F. Henglein. Efficient type inference for higher-order binding-time analysis. In Functional Programming & Computer Architecture, pages 448-472. Springer Verlag, LNCS 523, Aug. 1991.
13. J. Launchbury. Projection Factorizations in Partial Evaluation. PhD thesis. University of Glasgow, Nov. 1989.
14. M. Leone and P. Lee. Deferred compilation: The automation of run-time code generation. Technical Report CMU-CS-93-225, Carnegie-Mellon, Department of Computer Science, Pittsburgh, PA 15212, Dec. 1993.
15. A.-F. L. Meur, J. Lawall, and C. Consel. Towards bridging the gap between programming language and partial evaluation. In P. Thiemann, editor, ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 9-18, Portland, OR, USA, Jan. 2002. ACM Press.
16. T. Mogensen. Binding Time Analysis for Polymorphically Typed Higher Order Languages. In J. Diaz and F. Orejas, editors, TAPSOFT'89, Barcelona, Spain, volume 352 of LNCS, pages 298-312. Springer-Verlag, Mar. 1989.
17. T. A. Mogensen. Partially static structures in a self-applicable partial evaluator. North-Holland, 1988.
18. H. R. Nielson and F. Nielson. Automatic binding time analysis for a typed lambda-calculus. Science of Computer Programming, 10(2):139-176, Apr. 1988.
19. B. Rytz and M. Gengler. A polyvariant binding time analysis. In Proceedings of the 1992 ACM Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 21-28, San Francisco, U.S.A., June 1992. Association for Computing Machinery.
20. T. Sheard. Advanced Functional Programming, chapter Using MetaML: A staged Programming Language, pages 207-240. Springer, 1999.
21. T. Sheard. Accomplishments and research challenges in meta-programming. In W. Taha, editor, Proceedings of the Workshop on Semantics, Applications and Implementation of Program Generation (SAIG'01), volume 2196 of LNCS, pages 2-44, Berlin, September 2001. Springer Verlag. Invited talk.
22. T. Sheard, Z. Benaissa, and E. Pasalic. Dsl implementation using staging and monads. In Second Conference on Domain-Specific Languages (DSL'99), Austin, Texas, October 1999. USEUNIX.
23. W. Taha and T. 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.
24. P. Wadler. Comprehending monads. Proceedings of the ACM Symposium on Lisp and Functional Programming, Nice, France, pages 61-78, June 1990.
25. P. Wadler. The essence of functional programming. In Conference Record of the Nineteenth Annual ACM Symposium on Principles of Programming Languages, pages 1-14. ACM Press, Jan. 1992.
26. P. Wadler. Monads for functional programming. In J. Jeuring and E. Meijer, editors, Advanced Functional Programming, volume 925 of LNCS. Springer Verlag, 1995.