A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Filters
A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
Then, we define another transformation (tailored to defunctionalized programs) that allows us to get the accuracy of a polyvariant BTA from a monovariant BTA over the transformed program. ...
We introduce a transformational approach to improve the first stage of offline partial evaluation of functional programs, the so called binding-time analysis (BTA). ...
Acknowledgements We gratefully acknowledge the anonymous referees as well as the participants of LOPSTR 2008 for many useful comments and suggestions. ...
doi:10.1007/978-3-642-00515-2_4
fatcat:banrsatiijfslhs6gdijlygvui
Binding-Time Analysis in Partial Evaluation: One Size Does Not Fit All
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Our goal is to improve the usability of partial evaluator systems by developing an adaptive approach that can accommodate a variety of different strategies ranging from maximally polyvariant to entirely ...
The core of the analysis has been implemented in FSpec, an offline partial evaluator for a subset of Fortran 77. ...
These works deal with higher-order functional languages. ...
doi:10.1007/3-540-46562-6_7
fatcat:e6ut4eu56nephcsdkwqyx4jppa
DyC: an expressive annotation-directed dynamic compiler for C
2000
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Only three annotations were required, but a few other changes to the program had to be made due to DyC's lack of support for static global variables. ...
The majority of DyC's functionality has been used to dynamically compile an instruction-set simulator. ...
Acknowledgments We are grateful to Charles Consel for his help in understanding Tempo and some of the related issues in partial evaluation. ...
doi:10.1016/s0304-3975(00)00051-7
fatcat:tkoaruycxrewza5o6x6mmkuho4
Two Flavors of Offine Partial Evaluation
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Type-directed partial evaluation is a new approach to program specialization for functional programming languages. ...
We present a comparison of type-directed partial evaluation with standard offline partial evaluation in both a qualitative and quantitative way. ...
Theλ combinator interprets the dynamic lambda using a higher-order syntax representation, the@ combinator interprets dynamic application. ...
doi:10.1007/3-540-49366-2_15
fatcat:svqlua5hizb73jzzgmnz66gct4
A unified framework for binding-time analysis
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Binding-time analyses come in two flavors: A monovariant BTA computes a single mapping of program points to binding-times, whereas a polyvariant BTA allows for several such mappings. ...
Using the (static) input of the first stage it transforms a source program into a specialized residual program. ...
Acknowledgements Thanks to Olivier Danvy and Dirk Dussart for discussions on higher-order coercions and type-based program analysis. ...
doi:10.1007/bfb0030638
fatcat:5lbo57ecmncvrgxeovbpgo77qa
An Interactive Specializer Based on Partial Evaluation for a Java Subset
Интерактивный специализатор подмножества языка Java, основанный на методе частичных вычислений
2018
Proceedings of the Institute for System Programming of RAS
Интерактивный специализатор подмножества языка Java, основанный на методе частичных вычислений
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Specialization is a program optimization approach that implies the use of a priori information about values of some variables. ...
In this paper we provide a work-in-progress report on results of development of an interactive specializer based on partial evaluation for a subset of the Java programming language. ...
in particular and constructive feedback on the design of our specializer system. ...
doi:10.15514/ispras-2018-30(4)-2
fatcat:zy6sfmc4abg3neb33bh2cjujl4
Annotation-directed run-time specialization in C
1997
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Directed by a few declarative user annotations specifying where and on what dynamic compilation is to take place, a binding time analysis computes the set of run-time constants at each program point in ...
Our design is being implemented in the context of an existing optimizing compiler. * Polyvariant division allows the same program point to be analyzed for different combinations of variables being treated ...
Acknowledgments We are grateful to the anonymous PEPM'97 referees for their suggestions for refocusing this paper, and Charles Consel for his help in understanding Tempo and some of the related issues ...
doi:10.1145/258994.259016
fatcat:inzi7vkxtrcxlf7rxp3de3uf4q
Annotation-directed run-time specialization in C
1997
Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '97
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Directed by a few declarative user annotations specifying where and on what dynamic compilation is to take place, a binding time analysis computes the set of run-time constants at each program point in ...
Our design is being implemented in the context of an existing optimizing compiler. * Polyvariant division allows the same program point to be analyzed for different combinations of variables being treated ...
Acknowledgments We are grateful to the anonymous PEPM'97 referees for their suggestions for refocusing this paper, and Charles Consel for his help in understanding Tempo and some of the related issues ...
doi:10.1145/258993.259016
dblp:conf/pepm/GrantMPCE97
fatcat:7wmlgcqa2fahzkmd67l5qpd6qu
An evaluation of staged run-time optimizations in DyC
1999
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation - PLDI '99
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Program-pointspecific polyvariance enables polyvariance to arise at arbitrary points in programs, not just at function entries. ...
Polyvariant specialization allows multiple compiled versions of a division to be produced, each specialized for different values of the run-time-constant variables. ...
Acknowledgments We owe thanks to David Grove and the anonymous PLDI reviewers for improving the quality of our discussion, and to Tryggve Fossum and John O'Donnell for the source for the Alpha version ...
doi:10.1145/301618.301683
dblp:conf/pldi/GrantPMCE99
fatcat:x5pwez5bzrdljegw2z5tyocieq
An evaluation of staged run-time optimizations in DyC
1999
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Program-pointspecific polyvariance enables polyvariance to arise at arbitrary points in programs, not just at function entries. ...
Polyvariant specialization allows multiple compiled versions of a division to be produced, each specialized for different values of the run-time-constant variables. ...
Acknowledgments We owe thanks to David Grove and the anonymous PLDI reviewers for improving the quality of our discussion, and to Tryggve Fossum and John O'Donnell for the source for the Alpha version ...
doi:10.1145/301631.301683
fatcat:wjl6ahz2xngc5krqpleys5hwqq
Principal type specialisation
2002
Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation - ASIA-PEPM '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Type specialisation is an approach to program specialisation that works with both a program and its type to produce specialised versions of each. ...
This work presents a different formulation of the system specifying type specialisation capturing the notion of principal specialisation for a language with static constructions and polyvariance. ...
programs with a controlled kind of higher-order polymorphism. ...
doi:10.1145/568173.568184
dblp:conf/pepm/LopezH02
fatcat:wx4vmmkqafazhkj2lzt3fcmqkq
Transforming interpreters into inverse interpreters by partial evaluation
2003
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Limiting factors of offline partial evaluation were the polyvariant specialization scheme with its lack of generalization; advantages were the availability of higher-order values to specialize a breadthfirst ...
This application of self-applicable partial evaluation is different from the classical Futamura projections that tell us how to translate a program by specialization of an interpreter. ...
to Takeshi Takeuchi for testing some of the programs. ...
doi:10.1145/966049.777391
fatcat:iymfman5ofhtjdbdiz364fwvg4
Transforming interpreters into inverse interpreters by partial evaluation
2003
Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation - PEPM '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Limiting factors of offline partial evaluation were the polyvariant specialization scheme with its lack of generalization; advantages were the availability of higher-order values to specialize a breadthfirst ...
This application of self-applicable partial evaluation is different from the classical Futamura projections that tell us how to translate a program by specialization of an interpreter. ...
to Takeshi Takeuchi for testing some of the programs. ...
doi:10.1145/777388.777391
dblp:conf/pepm/GluckKH03
fatcat:ik3heqwf4zg2vablulu7q3hxfu
Formal Aspects of Polyvariant Specialization
2005
BRICS Report Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We present the first formal correctness proof of an offline polyvariant specialization algorithm for first-order recursive equations. ...
As a corollary, we show that the specialization algorithm generates a program implementing the search phase of the Knuth-Morris- Pratt algorithm from an inefficient but binding-time-improved string matcher ...
Acknowledgments A special thanks to Andrzej Filinski for introducing me to formal semantics; for encouragement; and for countless deep constructive comments. ...
doi:10.7146/brics.v12i34.21901
fatcat:g4afvhwttnbuhfg2ghoy2cw4am
Fortran program specialization
1995
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A partial evaluator is a tool for program transformation which takes as input a general program and a part of its input, and produces as output a specialized program. ...
The goal is efficiency: a specialized program often runs an order of magnitude faster than the general program. ...
Special thanks are due to Lars Ole Andersen for his continued interest and encouragement, and for thorough comments on an earlier version of this paper. This has been a great help. ...
doi:10.1145/202176.202184
fatcat:6itjgxhy5rbflejjtvoxj2bfja
« Previous
Showing results 1 — 15 out of 47 results