POPL
1995
ACM
13 years 7 months ago
1995
ACM
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
POPL
1995
ACM
13 years 7 months ago
1995
ACM
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
POPL
1995
ACM
13 years 7 months ago
1995
ACM
Flow-based safety analysis of higher-order languages has been studied by Shivers, and Palsberg and Schwartzbach. Open until now is the problem of finding a type system that accep...
POPL
1995
ACM
13 years 7 months ago
1995
ACM
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
POPL
1995
ACM
13 years 7 months ago
1995
ACM
We present a variant of the Standard ML module system rameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compattract types, inst...
POPL
1995
ACM
13 years 7 months ago
1995
ACM
Traditional techniques for implementing polymorphism use a universal representation for objects of unknown type. Often, this forces a compiler to use universal representations eve...
POPL
1995
ACM
13 years 7 months ago
1995
ACM
POPL
1995
ACM
13 years 7 months ago
1995
ACM
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
POPL
1995
ACM
13 years 7 months ago
1995
ACM
POPL
1995
ACM
13 years 7 months ago
1995
ACM
Obliq is a lexically-scoped, untyped, interpreted language that supports distributed object-oriented computation. Obliq objects have state and are local to a site. Obliq computati...