237 search results - page 20 / 48 » Coercions in a polymorphic type system |
TAPSOFT
1991
Springer
14 years 8 days ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
FOSSACS
2003
Springer
14 years 2 months ago
2003
Springer
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...
DLS
2007
14 years 21 days ago
2007
The analogy between types and contracts raises the question of how many features of static type systems can be expressed as dynamic contracts. An important feature missing in prio...
PPDP
2010
Springer
13 years 7 months ago
2010
Springer
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
ICFP
2009
ACM
14 years 9 months ago
2009
ACM
We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement...