Sciweavers

237 search results - page 2 / 48
» Coercions in a polymorphic type system
Sort
View
LICS
1994
IEEE
13 years 9 months ago
Subtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
Gordon D. Plotkin, Martín Abadi, Luca Carde...
ENTCS
2008
83views more  ENTCS 2008»
13 years 5 months ago
Dynamic Translucency with Abstraction Kinds and Higher-Order Coercions
traction Kinds and Higher-Order Coercions Andreas Rossberg1 Max Planck Institute for Software Systems Saarbr
Andreas Rossberg
ICFP
1999
ACM
13 years 9 months ago
Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
Atsushi Ohori, Nobuaki Yoshida
POPL
1997
ACM
13 years 9 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
APLAS
2010
ACM
13 years 5 months ago
A Certified Implementation of ML with Structural Polymorphism
Abstract. The type system of Objective Caml has many unique features, which make ensuring the correctness of its implementation difficult. One of these features is structurally pol...
Jacques Garrigue