Sciweavers

20 search results - page 3 / 4
» Faithful Ideal Models for Recursive Polymorphic Types
Sort
View
FPCA
1989
13 years 11 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,...
FOSSACS
2003
Springer
14 years 20 days ago
A Game Semantics for Generic Polymorphism
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
Samson Abramsky, Radha Jagadeesan
CIE
2007
Springer
13 years 11 months ago
A Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves ...
POPL
2007
ACM
14 years 7 months ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
SAC
2009
ACM
14 years 2 months ago
Matching ThisType to subtyping
The notion of ThisType has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. It is well-known, however, that This...
Chieri Saito, Atsushi Igarashi