Type specialization in aldor

Authors:
Laurentiu Dragan;Stephen M. Watt
Affiliations:
Computer Science Department, The University of Western Ontario, London, Canada;Computer Science Department, The University of Western Ontario, London, Canada
Venue:
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Year:
2010

Citing 4
Cited 1

Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
A first report on the A# compiler

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Escape analysis for Java

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Performance Analysis of Generics in Scientific Computing

SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Algebraic structures as typed objects

CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computer algebra in scientific computation squarely faces the dilemma of natural mathematical expression versus efficiency. While higher-order programming constructs and parametric polymorphism provide a natural and expressive language for mathematical abstractions, they can come at a considerable cost. We investigate how deeply nested type constructions may be optimized to achieve performance similar to that of hand-tuned code written in lower-level languages.