Sciweavers

27 search results - page 1 / 6
» Whole-program compilation in MLton
Sort
View
ML
2006
ACM
13 years 10 months ago
Whole-program compilation in MLton
Stephen Weeks
ASPLOS
2006
ACM
13 years 10 months ago
Tartan: evaluating spatial computation for whole program execution
Spatial Computing (SC) has been shown to be an energy-efficient model for implementing program kernels. In this paper we explore the feasibility of using SC for more than small k...
Mahim Mishra, Timothy J. Callahan, Tiberiu Chelcea...
PLDI
1999
ACM
13 years 9 months ago
Whole Program Paths
Whole program paths (WPP) are a new approach to capturing and representing a program’s dynamic—actually executed—control flow. Unlike other path profiling techniques, which ...
James R. Larus
ML
2008
ACM
115views Machine Learning» more  ML 2008»
13 years 4 months ago
Calling variadic functions from a strongly-typed language
The importance of providing a mechanism to call C functions from high-level languages has been understood for many years and, these days, almost all statically-typed high-level-la...
Matthias Blume, Mike Rainey, John H. Reppy
ICFP
2001
ACM
14 years 4 months ago
Contification Using Dominators
Contification is a compiler optimization that turns a function that always returns to the same place into a continuation. Compilers for functional languages use contification to e...
Matthew Fluet, Stephen Weeks