Sciweavers

16 search results - page 3 / 4
» Tunable Static Inference for Generic Universe Types
Sort
View
ECOOP
1999
Springer
13 years 9 months ago
Foundations for Virtual Types
Virtual types have been proposed as a notation for generic programming in object-oriented languages—an alternative to the more familiar mechanism of parametric classes. The trade...
Atsushi Igarashi, Benjamin C. Pierce
ESOP
2010
Springer
14 years 4 days ago
Amortized Resource Analysis with Polynomial Potential
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs....
Jan Hoffmann 0002, Martin Hofmann
POPL
1999
ACM
13 years 9 months ago
Typed Memory Management in a Calculus of Capabilities
An increasing number of systems rely on programming language technology to ensure safety and security of low-level code. Unfortunately, these systems typically rely on a complex, ...
Karl Crary, David Walker, J. Gregory Morrisett
FPCA
1989
13 years 9 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori

Book
301views
15 years 3 months ago
Programming in Standard ML
"Standard ML is a type-safe programming language that embodies many innovative ideas in programming language design. It is a statically typed language, with an extensible type...
Robert Harper