Sciweavers

POPL
2002
ACM
14 years 3 months ago
The first-order theory of subtyping constraints
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
Zhendong Su, Alexander Aiken, Joachim Niehren, Tim...
POPL
2002
ACM
14 years 3 months ago
Exploiting prolific types for memory management and optimizations
Yefim Shuf, Manish Gupta, Rajesh Bordawekar, Jaswi...
POPL
2002
ACM
14 years 3 months ago
A type system for certified binaries
Zhong Shao, Bratin Saha, Valery Trifonov, Nikolaos...
POPL
2002
ACM
14 years 3 months ago
An efficient profile-analysis framework for data-layout optimizations
Data-layout optimizations rearrange fields within objects, objects within objects, and objects within the heap, with the goal of increasing spatial locality. While the importance ...
Rastislav Bodík, Shai Rubin, Trishul M. Chi...
POPL
2002
ACM
14 years 3 months ago
Stochastic lambda calculus and monads of probability distributions
Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distribu...
Norman Ramsey, Avi Pfeffer
POPL
2002
ACM
14 years 3 months ago
Information flow inference for ML
François Pottier, Vincent Simonet
POPL
2002
ACM
14 years 3 months ago
Towards automatic construction of staged compilers
Some compilation systems, such as offline partial evaluators and selective dynamic compilation systems, support staged optimizations. A staged optimization is one where a logicall...
Matthai Philipose, Craig Chambers, Susan J. Eggers
POPL
2002
ACM
14 years 3 months ago
Functional logic overloading
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
Matthias Neubauer, Peter Thiemann, Martin Gasbichl...
POPL
2002
ACM
14 years 3 months ago
CCured: type-safe retrofitting of legacy code
In this paper we propose a scheme that combines type inference and run-time checking to make existing C programs type safe. We describe the CCured type system, which extends that ...
George C. Necula, Scott McPeak, Westley Weimer
POPL
2002
ACM
14 years 3 months ago
Composing dataflow analyses and transformations
Dataflow analyses can have mutually beneficial interactions. Previous efforts to exploit these interactions have either (1) iteratively performed each individual analysis until no...
Sorin Lerner, David Grove, Craig Chambers