65 search results - page 2 / 13 » The Heap Lambda Machine |
TCS
2008
13 years 4 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
CEFP
2007
Springer
13 years 11 months ago
2007
Springer
APLAS
2010
ACM
13 years 2 months ago
2010
ACM
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
CGO
2010
IEEE
13 years 2 months ago
2010
IEEE
Dynamic memory allocation is widely used in modern programs. General-purpose heap allocators often focus more on reducing their run-time overhead and memory space utilization, but...
ICPPW
2009
IEEE
13 years 11 months ago
2009
IEEE
—In this paper, we investigate the differences and tradeoffs imposed by two parallel Haskell dialects running on multicore machines. GpH and Eden are both constructed using the h...