Sciweavers

43 search results - page 4 / 9
» Parametric polymorphism and operational equivalence
Sort
View
75
Voted
LICS
2007
IEEE
15 years 6 months ago
Relational Parametricity for Computational Effects
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
Rasmus Ejlers Møgelberg, Alex Simpson
TACS
1991
Springer
15 years 3 months ago
An Extension of System F with Subtyping
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
Luca Cardelli, Simone Martini, John C. Mitchell, A...
ICFP
2004
ACM
15 years 11 months ago
Translating dependency into parametricity
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
Stephen Tse, Steve Zdancewic
78
Voted
TACS
1997
Springer
15 years 3 months ago
Optimal Representations of Polymorphic Types with Subtyping (Extended Abstract)
d Abstract) Alexander Aiken1 and Edward L. Wimmers2 and Jens Palsberg3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Cent...
Alexander Aiken, Edward L. Wimmers, Jens Palsberg
179
Voted
ICFP
2009
ACM
16 years 9 days ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg