Sciweavers

1264 search results - page 179 / 253
» Abstract machines for programming language implementation
Sort
View
PLDI
2012
ACM
11 years 10 months ago
Fast and precise hybrid type inference for JavaScript
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
Brian Hackett, Shu-yu Guo
ASM
2004
ASM
14 years 1 months ago
Intra-step Interaction
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
Yuri Gurevich
CC
2004
Springer
163views System Software» more  CC 2004»
14 years 1 months ago
Declarative Composition of Stack Frames
When a compiler translates a procedure, it must lay out the procedure’s stack frame in a way that respects the calling convention. Many compilers respect the convention either by...
Christian Lindig, Norman Ramsey
PLDI
2011
ACM
12 years 11 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
WOMPAT
2001
Springer
14 years 17 days ago
Portable Compilers for OpenMP
Abstract. The recent parallel language standard for shared memory multiprocessor (SMP) machines, OpenMP, promises a simple and portable interface for programmers who wish to exploi...
Seung-Jai Min, Seon Wook Kim, Michael Voss, Sang I...