License: Creative Commons Attribution 3.0 Germany license (CC BY 3.0 DE)
When quoting this document, please refer to the following
DOI: 10.4230/DARTS.3.2.14
URN: urn:nbn:de:0030-drops-72952
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7295/
Saleil, Baptiste ;
Feeley, Marc
Interprocedural Specialization of Higher-Order Dynamic Languages Without Static Analysis (Artifact)
Abstract
This artifact is based on LC, a research oriented JIT compiler for Scheme. The compiler is extended to allow interprocedural, type based, code specialization using the technique and its implementation presented in the paper. Because the technique is directly implemented in LC, the package contains the build of the compiler used for our experiments. To support repeatability, the artifact allows the user to easily extract the data presented in the paper such as the number of executed type checks or the generated code size. The user can repeat the experiments using a set of standard benchmarks as well as its own programs. Instructions for building the compiler from scratch are also provided.
BibTeX - Entry
@Article{saleil_et_al:DARTS:2017:7295,
author = {Baptiste Saleil and Marc Feeley},
title = {{Interprocedural Specialization of Higher-Order Dynamic Languages Without Static Analysis (Artifact)}},
pages = {14:1--14:2},
journal = {Dagstuhl Artifacts Series},
ISSN = {2509-8195},
year = {2017},
volume = {3},
number = {2},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7295},
URN = {urn:nbn:de:0030-drops-72952},
doi = {10.4230/DARTS.3.2.14},
annote = {Keywords: just-in-time compilation, interprocedural optimization, dynamic language, higher-order function, scheme}
}
Keywords: |
|
just-in-time compilation, interprocedural optimization, dynamic language, higher-order function, scheme |
Collection: |
|
DARTS, Volume 3, Issue 2 |
Related Scholarly Article: |
|
http://dx.doi.org/10.4230/LIPIcs.ECOOP.2017.23 |
Issue Date: |
|
2017 |
Date of publication: |
|
20.06.2017 |