Fulltext present in this item

Thumbnail
Fulltext: 60227.pdf
Format: PDF
Description: author's version
Title: Optimizing Generic Functions
Author(s): Alimarine, A. ; Smetsers, J.E.W.
Publication year: 2004
In: Proceedings Seventh International Conference on Mathematics of Program Construction (MPC 2004), pp. 16-31
Publisher: [S.l.] : Springer
Publication type: Article in monograph or in proceedings

Please use this identifier to cite or link to this item : https://hdl.handle.net/2066/60227   https://hdl.handle.net/2066/60227

Display more details
Subject: Software Technology
Organization: Software Technology
Security of Systems
Book title: Proceedings Seventh International Conference on Mathematics of Program Construction (MPC 2004)
Page start: p. 16
Page end: p. 31
Abstract:
Generic functions are defined by induction on the structural representation of types. As a consequence, by defining just a single generic operation, one acquires this operation over any particular type. An instance on a specific type is generated by interpretation of the type's structure. A direct translation leads to extremely inefficient code that involves many conversions between types and their structural representations. In this paper we present an optimization technique based on compile-time symbolic evaluation. We prove that the optimization removes the overhead of the generated code for a considerable class of generic functions. The proof uses typing to identify intermediate data structures that should be eliminated. In essence, the output after optimization is similar to hand-written code.

This item appears in the following Collection(s)

Browse

Statistics