Sciweavers

237 search results - page 23 / 48
» Coercions in a polymorphic type system
Sort
View
ICFP
1999
ACM
14 years 1 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...
ICFP
2000
ACM
14 years 11 days ago
Fully reflexive intensional type analysis
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...
Valery Trifonov, Bratin Saha, Zhong Shao
FLOPS
2010
Springer
14 years 3 months ago
A Church-Style Intermediate Language for MLF
MLF is a type system that seamlessly merges ML-style implicit but second-class polymorphism with System F explicit first-class polymorphism. We present xMLF, a Church-style versi...
Didier Rémy, Boris Yakobowski
ISCA
2003
IEEE
114views Hardware» more  ISCA 2003»
14 years 2 months ago
Exploiting ILP, TLP and DLP with the Polymorphous TRIPS Architecture
This paper describes the polymorphous TRIPS architecture which can be configured for different granularities and types of parallelism. TRIPS contains mechanisms that enable the p...
Karthikeyan Sankaralingam, Ramadass Nagarajan, Hai...
ICFP
2010
ACM
13 years 9 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...