137
click to vote
POPL
1995
ACM
15 years 8 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...
142
click to vote
POPL
1995
ACM
15 years 8 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...
211
click to vote
POPL
1995
ACM
15 years 8 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...
135
click to vote
POPL
1995
ACM
15 years 8 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...
144
click to vote
POPL
1995
ACM
15 years 8 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...