39 search results - page 2 / 8 » Generalizing Cook's Transformation to Imperative Stack Progr... |
ICFP
2005
ACM
14 years 6 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
POPL
1998
ACM
13 years 10 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
POPL
2007
ACM
14 years 6 months ago
2007
ACM
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...
VLDB
1995
ACM
13 years 9 months ago
1995
ACM
We follow the stack-baaed approach to query languages which is a new formal and intellectual paradigm for integrating querying and programming for object-oriented databases. Queri...
JLP
2007
13 years 6 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...