Sciweavers

1294 search results - page 86 / 259
» FFT Compiler Techniques
Sort
View
POPL
2004
ACM
14 years 9 months ago
Polymorphic typed defunctionalization
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
François Pottier, Nadji Gauthier
ICFP
2001
ACM
14 years 8 months ago
Extensible Algebraic Datatypes with Defaults
A major problem for writing extensible software arises when recursively defined datatypes and operations on these types have to be extended simultaneously without modifying existi...
Matthias Zenger, Martin Odersky
POPL
1996
ACM
14 years 28 days ago
From Region Inference to von Neumann Machines via Region Representation Inference
Region Inference is a technique for implementing programming languages that are based on typed call-by-value lambda calculus, such as Standard ML. The mathematical runtime model o...
Lars Birkedal, Mads Tofte, Magnus Vejlstrup
IPPS
1995
IEEE
14 years 10 days ago
Symbolic range propagation
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6 . In previous work we have introduced an algorithm calle...
William Blume, Rudolf Eigenmann
LCPC
1995
Springer
14 years 10 days ago
Demand-Driven, Symbolic Range Propagation
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6]. In previous work we have introduced an algorithm calle...
William Blume, Rudolf Eigenmann