Sciweavers

7 search results - page 1 / 2
» Instance chains: type class programming without overlapping ...
Sort
View
ICFP
2010
ACM
13 years 6 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
OOPSLA
1990
Springer
13 years 9 months ago
Type Substitution for Object-Oriented Programming
Genericity allows the substitution of types in a class. This is usually obtained through parameterized classes, although they are inflexible since any class can be inherited but i...
Jens Palsberg, Michael I. Schwartzbach
PADL
2010
Springer
14 years 1 months ago
Explicitly Typed Exceptions for Haskell
Abstract. We describe a monad for checked, explicitly typed exceptions, which provides as a simple Haskell library what for other languages is a native feature. Multi parameter typ...
José Iborra
ASPLOS
2006
ACM
13 years 11 months ago
Type inference for unboxed types and first class mutability
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
Swaroop Sridhar, Jonathan S. Shapiro
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
13 years 10 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...