A new approach to compiling adaptive programs

Jens Palsberg, Boaz Patt-Shamir, Karl Lieberherr

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

An adaptive program can be understood as an object-oriented program where the class graph is a parameter, and hence the class graph may be changed without changing the program. The problem of compiling an adaptive program and a class graph into an object-oriented program was studied by Palsberg, Xiao, and Lieberherr in 1995. Their compiler is efficient but works only in special cases. In this paper we present and prove the correctness of a compiler that handles the general case. The compiler first computes a finite-state automaton and then uses it to generate efficient code.

Original languageEnglish
Title of host publicationProgramming Languages and Systems - ESOP 1996 - 6th European Symposium on Programming, Proceedings
EditorsHanne Riis Nielson
PublisherSpringer Verlag
Pages280-295
Number of pages16
ISBN (Print)3540610553, 9783540610557
DOIs
StatePublished - 1996
Externally publishedYes
Event6th European Symposium on Programming Languages and Systems, ESOP 1996 - Linkoping, Sweden
Duration: 22 Apr 199624 Apr 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1058
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th European Symposium on Programming Languages and Systems, ESOP 1996
Country/TerritorySweden
CityLinkoping
Period22/04/9624/04/96

Funding

FundersFunder number
BRIGS
Basic Research in Computer Science, Centre of the Danish National Research Foundation
National Science FoundationCCR-9402486, CDA-9015692

    Fingerprint

    Dive into the research topics of 'A new approach to compiling adaptive programs'. Together they form a unique fingerprint.

    Cite this