FPCA
1989
13 years 12 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 12 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 12 months ago
1989
ECOOP
1989
Springer
13 years 12 months ago
1989
Springer
ECOOP
1989
Springer
13 years 12 months ago
1989
Springer
ECOOP
1989
Springer
13 years 12 months ago
1989
Springer
CTCS
1989
Springer
13 years 12 months ago
1989
Springer
We combine the principles of the Floyd-Warshall-Kleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertex-labeled s...
CTCS
1989
Springer
13 years 12 months ago
1989
Springer
The type-theoretic explanation of modules proposed to date (for programming languages like ML) is unsatisfactory, because it does not capture that evaluation of type-expressions i...
CTCS
1989
Springer
13 years 12 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
ASPLOS
1989
ACM
13 years 12 months ago
1989
ACM