22 search results - page 3 / 5 » popl 2000 |
POPL
2000
ACM
13 years 9 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
POPL
2000
ACM
13 years 9 months ago
2000
ACM
Many interactive Web services use the CGI interface for communication with clients. They will dynamically create HTML documents that are presented to the client who then resumes t...
POPL
2000
ACM
13 years 9 months ago
2000
ACM
Various code certification systems allow the certification and static verification of important safety properties such as memory and control-flow safety. These systems are valuabl...
POPL
2000
ACM
13 years 9 months ago
2000
ACM
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...
POPL
2007
ACM
14 years 5 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...