Sciweavers

POPL
1989
ACM
15 years 4 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
116
Voted
FPCA
1989
15 years 4 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
CTCS
1989
Springer
15 years 4 months ago
Quantitative Domains, Groupoids and Linear Logic
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...
Paul Taylor 0002
101
Voted
FPCA
1989
15 years 4 months ago
F-Bounded Polymorphism for Object-Oriented Programming
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...
Peter S. Canning, William R. Cook, Walter L. Hill,...
116
Voted
IFIP
1989
Springer
15 years 4 months ago
Software Fault Tolerance
The designation “fault tolerant software” has been used for techniques ranging from roll-back and retry to N-version programming, from data mirroring to functional redundancy....
Algirdas Avizienis
Programming Languages
Top of PageReset Settings