170
click to vote
CTCS
15 years 10 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...
139
click to vote
CTCS
15 years 10 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...
141
click to vote
CTCS
15 years 10 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...
|
Programming Languages