Sciweavers

ICFP
2006
ACM
14 years 7 months ago
Context-parametric polykinded types
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
Pablo Nogueira
ICFP
2006
ACM
14 years 7 months ago
Modular generic programming with extensible superclasses
"Generics for the Masses" (GM) and "Scrap your Boilerplate" (SYB) are generic programming approaches based on some ingenious applications of Haskell type class...
Martin Sulzmann, Meng Wang
ICFP
2006
ACM
14 years 7 months ago
Good advice for type-directed programming aspect-oriented programming and extensible generic functions
Type-directed programming is an important idiom for software design. In type-directed programming the behavior of programs is guided by the type structure of data. It makes it pos...
Geoffrey Washburn, Stephanie Weirich
ICFP
2006
ACM
14 years 7 months ago
Generating generic functions
Johan Jeuring, Alexey Rodriguez, Gideon Smeding
ICFP
2006
ACM
14 years 7 months ago
A technique for generic iteration and its optimization
Software libraries rely increasingly on iterators to provide generic traversal of data structures. These iterators can be represented either as objects that maintain state or as p...
Stephen M. Watt
ICFP
2006
ACM
14 years 7 months ago
Static typing for a faulty lambda calculus
A transient hardware fault occurs when an energetic particle strikes a transistor, causing it to change state. These faults do not cause permanent damage, but may result in incorr...
David Walker, Lester W. Mackey, Jay Ligatti, Georg...
ICFP
2006
ACM
14 years 7 months ago
Boxy types: inference for higher-rank types and impredicativity
Languages with rich type systems are beginning to employ a blend of type inference and type checking, so that the type inference engine is guided by programmer-supplied type annot...
Dimitrios Vytiniotis, Stephanie Weirich, Simon L. ...
ICFP
2006
ACM
14 years 7 months ago
The missing link: dynamic components for ML
Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so f...
Andreas Rossberg
ICFP
2006
ACM
14 years 7 months ago
From structures and functors to modules and units
t programming techniques encourage abstraction and reuse through external linking. Some parts of a program, however, must use concrete, internally specified references, so a pure ...
Scott Owens, Matthew Flatt