A unified framework for binding-time analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1214, Issue , 1997, Pages 742-756

  Thiemann, Peter ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BINDING TIME ANALYSIS; DESIGN SPACES; PARTIAL EVALUATION; RECURSIVE TYPES; SIMPLE TYPES; STANDARD TYPE; TYPE INFERENCES; UNIFIED FRAMEWORK;

SOFTWARE DESIGN;

EID: 84956981505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030638     Document Type: Conference Paper

References (34)

1. R. M. Amdio and L. Cardelli. Subtyping recursive types. ACM Trans. Prog. Lang. Syst., 15(4):575-631, 1993.
2. L. Birkedal and M. Welinder. Binding-time analysis for Standard-ML. In P. Sestoft and H. Sendergaard, editors, Proc. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation PEPM '94, pages 61-71, Orlando, Fla., June 1994. ACM.
3. A. Bondorf. Automatic autoprojection of higher order recursive equations. Science of Programming, 17:3-34, 1991.
4. A. Bondorf and J. Jergensen. Ei~icient analysis for realistic off-line partial evaluation. Journal of Functional Programming, 3(3):315-346, July 1993.
5. C. Consel. Binding time analysis for highe r order untyped functional languages. In LFP 1990 [23], pages 264-272.
6. C. Consel. Polyvariant binding-time analysis for applicative languages. In D. Schmidt, editor, Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation PEPM '93, pages 66-77, Copenhagen, Denmark, June 1993. ACM Press.
7. C. Consel and O. Danvy. Tutorial notes on partial evaluation. In Proe. 20th Annual ACM Symposium on Principles of Programming Languages, pages 493-501, Charleston, South Carolina, Jan. 1993. ACM Press.
8. O. Danvy. Type-directed partial evaluation. In Proc. 23rd Annual ACM Symposium on Principles of Programming Languages, pages 242-257, St. Petersburg, Fla., Jan. 1996. ACM Press.
9. O. Danvy, K. Malmkjaer, and J. Palsberg. The essence of eta-expansion in partial evaluation. Lisp and Symbolic Computation, 8(3):209-227, July 1995.
10. O. Danvy, K. Malmkjaer, and J. Palsberg. Eta-expansion does The Trick. Technical Report BRICS RS-95-41, Computer Science Dept., Aarhus University, Denmark, Aug. 1995.
11. R. Di Cosmo and D. Kesner. Simulating expansions without expansions. Mathematical Structures in Computer Science, 4:1-48, 1994.
12. D. Dussart, F. Henglein, and C. Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In Mycroft [26], pages 118-136. LNCS 983.
13. R. Gliick and J. Jergensen. Fast multi-level binding-time analysis for multiple program specialization. In PSI '96 [31].
14. C. K. Gomard. Partial type inference for untyped functional programs. In LFP 1990 [23], pages 282-287.
15. C.K. Gomard and N. D. Jones. A partial evaluator for the untyped lambdacalculus. Journal of Functional Programming, 1(1):21-70, Jan. 1991.
16. N. Heintze. Set-based analysis of ML-programs. In Proc. 1994 ACM Conference on Lisp and Functional Programming, pages 306-317, Orlando, Florida, USA, June 1994. ACM Press.
17. N. Heintze. Control-flow analysis and type systems. In Mycroft [26], pages 189-206. LNCS 983.
18. F. Henglein. Efficient type inference for higher-order binding-time analysis. In J. Hughes, editor, Proe. Functional Programming Languages and Computer Architecture 1991, pages 448-472, Cambridge, MA, 1991. Springer-Verlag. LNCS 523.
19. J. E. Hopcroft and J. D. Ullman. Introduction to automata theory, languages and computation. Addison-Wesley, 1979.
20. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
21. N. D. Jones, P. Sestoft, and H. Søndergaard. An experiment in partial evaluation: The generation of a compiler generator. In J.-P. Jouannaud, editor, RewritingTechniques and Applications, pages 124-140, Dijon, France, 1985. Springer-Verlag. LNCS 202.
22. J. Launchbury. Projection Factorisations in Partial Evaluation, volume 1 of Distinguished Dissertations in Computer Science. Cambridge University Press, 1991.
23. Proc. 1990 ACM Conference on Lisp and Functional Programming, Nice, France, 1990. ACM Press.
24. K. Malmkjeer, O. Danvy, and Iq. Heintze. ML partial evaluation using set-based analysis. In Record of the ACM-SIGPLAN Workshop on ML and its Applications,number 2265 in INRIA Research Report, pages 112-119, BP 105, 78153 Le Chesnay Cedex, France, June 1994.
25. T.Æ. Mogensen. 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, pages 116-121, San Francisco, CA, June 1992. Yale University. Report YALEU/DCS/RR-909.
26. A. Mycroft, editor. Proc. International Static Analysis Symposium, SAS'95, Glasgow, Scotland, Sept. 1995. Springer-Verlag. LNCS 983.
27. F. Nielson and H. R. Nielson. Two-Level Functional Languages. Cambridge University Press, 1992.
28. F. Nielson and H. R. Nielson. Multi-level lambda-calculi: an algebraic description. In O. Danvy, R. Gliick, and P. Thiemann, editors, Partial Evaluation, volume 1110 of Lecture Notes in Computer Science, pages 338-354, Dagstuhl, Germany, Feb. 1996. Springer Verlag, Heidelberg.
29. J. Palsberg and P. O'Keefe. A type system equivalent to flow analysis. In Proc. 22nd Annual ACM Symposium on Principles of Programming Languages, pages 367-378, San Francisco, CA, Jan. 1995. ACM Press.
30. J. Pulsberg and M. I. Schwartzbach. Binding-time analysis: Abstract interpretation versus type inference. In IEEE International Conference on Computer Languages 1994, pages 289-298, Toulouse, France, 1994. IEEE Computer Society Press.
31. PSI-96: Andrei Ershov Second International Memorial Conference, Perspectives of System Informatics, volume 1181 of Lecture Notes in Computer Science, Novosibirsk, Russia, June 1996. Springer-Verlag.
32. H. Seidl. Least solutions of equations over Af. In Proc. International Conference of Automata, Languages and Programming, ICALP '94, volume 820 of Lecture Notes in Computer Science, pages 400-411. Springer-Verlag, 1994.
33. K. L. Solberg. 'Annotated Type Systems for Program Analysis. PhD thesis, Odense University, Denmark, July 1995. Also technical report DAIMI PB-498, Comp. Sci. Dept. Aarhus University.
34. P. Thiemann. Towards partial evaluation of full Scheme. In G. Kiczales, editor, Reflection'96, pages 95-106, San Francisco, CA, USA, Apr. 1996.