Guaranteed optimization for domain-specific programming

0Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For software engineering reasons, it is often best to provide domain-specific programming environments in the context of a generalpurpose language. In our view general-purpose languages are not yet general-purpose enough, and progress needs to be made before we can provide domain-specific languages that are both fast and safe. We outline some goals in this regard, and describe a possible implementation technology: guaranteed optimization, a technique for building compilers that provide proven guarantees of what optimizations they perform. Such optimizers can provide capabilities similar to staged languages, and thus provide the relevant performance improvements. They can also function as decision procedures, suggesting an approach of ‘optimizers as theorem provers,' in which optimizing compilers can be used to check domainspecific safety properties and check proofs embedded in programs.

Cite

CITATION STYLE

APA

Veldhuizen, T. L. (2004). Guaranteed optimization for domain-specific programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3016, pp. 307–324). Springer Verlag. https://doi.org/10.1007/978-3-540-25935-0_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free