Sciweavers

FP
1991
95views Formal Methods» more  FP 1991»
13 years 10 months ago
Making Functionality More General
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
Graham Hutton, Ed Voermans
ECOOP
1991
Springer
13 years 10 months ago
What is Type-Safe Code Reuse?
Jens Palsberg, Michael I. Schwartzbach
ECOOP
1991
Springer
13 years 10 months ago
Optimizing Dynamically-Typed Object-Oriented Languages With Polymorphic Inline Caches
: Polymorphic inline caches (PICs) provide a new way to reduce the overhead of polymorphic message sends by extending inline caches to include more than one cached lookup result pe...
Urs Hölzle, Craig Chambers, David Ungar
ECOOP
1991
Springer
13 years 10 months ago
Incremental Class Dictionary Learning and Optimization
We have previously shown how the discovery of classes from objects can be automated, and how the resulting class organization can be e ciently optimized in the case where the opti...
Paul L. Bergstein, Karl J. Lieberherr
CTCS
1991
Springer
13 years 10 months ago
Stone Duality for Stable Functions
Thomas Ehrhard, Pasquale Malacaria
COMPASS
1991
13 years 10 months ago
Label Algebras: A Systematic Use of Terms
: We give the main definitions and results of a new framework for algebraic specifications: the framework of label algebras. The main idea underlying our approach is that the sem...
Gilles Bernot, Pascale Le Gall
ASPLOS
1994
ACM
13 years 10 months ago
LCM: Memory System Support for Parallel Language Implementation
James R. Larus, Brad Richards, Guhan Viswanathan
ASPLOS
1991
ACM
13 years 10 months ago
The Cache Performance and Optimizations of Blocked Algorithms
Blocking is a well-known optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorith...
Monica S. Lam, Edward E. Rothberg, Michael E. Wolf