Result: Optimizing generic functions

Title:
Optimizing generic functions
Authors:
ALIMARINE, Artem, SMETSERS, Sjaak
Source:
MPC 2004 : mathematics of program construction (Stirling, 12-14 July 2004)Lecture notes in computer science. :16-31
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 1 p.3/4
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Logiciel, Software, Génie logiciel, Software engineering, Développement logiciel, Software development, Desarrollo logicial, Optimisation, Optimization, Optimización, Structure donnée, Data structure, Estructura datos, Théorie type, Type theory, Typage, Typing, Tipificación, Programmation générique, Generic programming, Programación genérica
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Computing Science Institute, University of Nijmegen, Toernooiveld 1, 6525 ED Nijmegen, Netherlands
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15993873
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15993873
Database:
PASCAL Archive

Further Information

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.