FPCA
1989
13 years 8 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
FPCA
1989
13 years 8 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
FPCA
1989
13 years 8 months ago
1989
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...
FPCA
1989
13 years 8 months ago
1989
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
FPCA
1989
13 years 8 months ago
1989
