Qualified types can be viewed as a generalization of type classes in the functional language Haskell and the theorem prover Isabelle. These in turn are extensions of equality types in Standard ML. Other applications of qualified types include extensible records and subtyping. This book describes the use of qualified types to provide a general framework for the combination of polymorphism and overloading. Using a general formulation of qualified types,...
Related Subjects
Algorithms Computer Science Computers Computers & Technology Data Structures Education & Reference Languages & Tools Mathematics Programming Programming Languages Science & Math Software Design & Engineering Software Design, Testing & Engineering Software Development Software Engineering