Partial Evaluation for Common Intermediate Language
- 318 Downloads
Partial Evaluation is a well-established method for specialization of programs in functional languages. However, real-world applications demand specialization of object-oriented languages. With the advent of the Microsoft .NET platform with Common Intermediate Language (CIL), to which multiple languages are compiled, various program analysis and transformation techniques, including partial evaluation, can be developed once for a low-level language rather than over and over again to various high-level languages. The CILPE Project aims at developing a practical specializer for CIL programs based on Partial Evaluation with preliminary analysis referred to as Binding Time Analysis (BTA). The CILPE Specializer partially evaluates operations on values and objects determined by BTA as static. Static objects are created, processed and destroyed at specialization time; they may be mutable and can have some fields unknown (dynamic). Arbitrary verifiable CIL code is allowed as input.
KeywordsProgram transformation Partial Evaluation polyvariant Binding-Time Analysis mutable objects object-oriented languages Common Intermediate Language
Unable to display preview. Download preview PDF.
- 3.Bertelsen, P.: Binding-time analysis for a JVM core language (April 1999), ftp://ftp.dina.kvl.dk/pub/Staff/Peter.Bertelsen/bta-core-jvm.ps.gz
- 4.Di Iorio, V., Bigonha, R., Maia, M.: A Self-Applicable Partial Evaluator for ASM. In: Gurevich, Y., Kutter, P., Odersky, M., Thiele, L. (eds.) Abstract State Machines – ASM 2000, International Workshop on Abstract State Machines, Local Proceedings, Monte Verita, Switzerland, March 2000. TIK-Report, vol. 87, pp. 115–130. Swiss Federal Institute of Technology (ETH), Zurich (2000)Google Scholar
- 5.ECMA International: Common Language Infrastructure (CLI), Standard ECMA- 335, 2nd edn (December 2002), http://www.ecma-international.org/publications/standards/ecma-335.htm
- 6.Ershov, A.P.: On the essence of compilation. Programmirovanie (5), 21–39 (1977) (in Russian); See translation in: Neuhold, E.J. (ed.) Formal description of Programming Concepts, pp. 391–420. North-Holland, Amsterdam (1978)Google Scholar
- 7.Goertzel, B., Klimov, A.V., Klimov, A.V.: Supercompiling Java Programs, white paper, Supercompilers LLC (2002), http://www.supercompilers.com
- 8.Gurevich, Y., Huggins, J.: Evolving Algebras and Partial Evaluation. In: Pehrson, B., Simon, I. (eds.) IFIP 13th World Computer Congress. Technology/Foundations, vol. I, pp. 587–592. Elsevier, Amsterdam (1994)Google Scholar
- 10.Marquard, M., Steensgaard, B.: Partial Evaluation of an Object-Oriented Imperative Language, Master’s Thesis, Department of Computer Science, University of Copenhagen, Denmark (April 1992), ftp://ftp.research.microsoft.com/users/rusa/thesis.ps.Z
- 11.Romanenko, S.A.: A Compiler Generator Produced by a Self-Applicable Specializer Can have a Surprisingly Natural and Understandable Structure. In: Bjorner, D., Ershov, A.P., Jones, N.D. (eds.) Workshop on Partial Evaluation and Mixed Computation, GI. Avernaxs, Denmark, October 1987, pp. 445–463. North-Holland, Amsterdam (1988)Google Scholar
- 12.Romanenko, S.A.: Arity Raiser and Its Use in Program Specialization. In: Jones, N.D. (ed.) ESOP 1990. LNCS, vol. 432, pp. 341–360. Springer, Heidelberg (1990)Google Scholar