Sciweavers

1892 search results - page 305 / 379
» Warren's Abstract Machine
Sort
View
POPL
1996
ACM
14 years 27 days ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
TLCA
1997
Springer
14 years 27 days ago
Games and Weak-Head Reduction for Classical PCF
We present a game model for classical PCF, a nite version of PCF extended by a catch/throw mechanism. This model is build from E-dialogues, a kind of two-players game de ned by Lor...
Hugo Herbelin
ICCAD
1994
IEEE
134views Hardware» more  ICCAD 1994»
14 years 26 days ago
Boolean constrained encoding: a new formulation and a case study
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
Ney Laert Vilar Calazans
APL
1993
ACM
14 years 26 days ago
The Role of APL and J in High-Performance Computation
Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited....
Robert Bernecky
BIRTHDAY
1994
Springer
14 years 26 days ago
Generalizing Cook's Transformation to Imperative Stack Programs
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
Nils Andersen, Neil D. Jones