Sciweavers

429 search results - page 25 / 86
» Parameter-free polymorphic types
Sort
View
97
Voted
SCP
2002
119views more  SCP 2002»
14 years 11 months ago
Polymorphic subtyping in O'Haskell
O'Haskell is a programming language derived from Haskell by the addition of concurrent reactive objects and subtyping. Because Haskell already encompasses an advanced type sy...
Johan Nordlander
ICFP
2003
ACM
15 years 11 months ago
MLF: raising ML to the power of system F
We propose a type system MLFthat generalizes ML with first-class polymorphism as in System F. Expressions may contain secondorder type annotations. Every typable expression admits...
Didier Le Botlan, Didier Rémy
APLAS
2005
ACM
15 years 5 months ago
Lightweight Family Polymorphism
The formal core calculus .FJ has been introduced to model lightweight family polymorphism, a programming style to support reusable yet type-safe mutually recursive classes. This pa...
Atsushi Igarashi, Chieri Saito, Mirko Viroli
POPL
1993
ACM
15 years 3 months ago
Formal Parametric Polymorphism
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typ...
Martín Abadi, Luca Cardelli, Pierre-Louis C...
APLAS
2008
ACM
15 years 1 months ago
Sound and Complete Type Inference for a Systems Programming Language
This paper introduces a new type system designed for safe systems programming. The type system features a new mutability model that combines unboxed types with a consistent typing ...
Swaroop Sridhar, Jonathan S. Shapiro, Scott F. Smi...