POPL
1998
ACM
13 years 12 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
POPL
1998
ACM
13 years 12 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 12 months ago
1998
ACM
POPL
1998
ACM
13 years 12 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 12 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
POPL
1998
ACM
13 years 12 months ago
1998
ACM
This paper addresses the problem of how to apply pointer analysis to a wide variety of compiler applications. We are not presenting a new pointer analysis. Rather, we focus on put...
POPL
1998
ACM
13 years 12 months ago
1998
ACM
POPL
1998
ACM
13 years 12 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 12 months ago
1998
ACM
POPL
1998
ACM
13 years 12 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...