16 search results - page 2 / 4 » popl 1998 |
POPL
1998
ACM
13 years 9 months ago
1998
ACM
The SLam calculus is a typed -calculus that maintains security information as well as type information. The type system propagates security information for each object in four for...
POPL
1998
ACM
13 years 9 months ago
1998
ACM
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
POPL
1998
ACM
13 years 9 months ago
1998
ACM
Recent years have seen increasing interest in systems that reason about and manipulate executable code. Such systems can generally benefit from information about aliasing. Unfort...
POPL
1998
ACM
13 years 9 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
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...