μετα 2008

First International Workshop on Metacomputation in Russia
 

July 2-5, 2008, Pereslavl-Zalessky (120 km to the north-east from Moscow), Russia

Home
Call For Papers
Submissions
Accepted Papers
Program
Important Dates
Registration
Visa Support
Place
Affiliated Meetings
Contacts
Sponsors

 

 

 

 

An Approach to Polyvariant Binding Time Analysis for a Stack-Based Language

Yuri A. Klimov
 

Abstract

Full text pdf 243 KB

Binding time analysis (BTA) is used in specialization by means of partial evaluation method. Usual BTA only annotates a source program. Polyvariant BTA transforms a source program to an annotated one. Polyvariant BTA is known technique for functional languages. In this paper polyvariant BTA for a model imperative stack-based language is presented. It is described by means of building annotated control-flow graph for a source program.