Polymorphic subtyping in O'Haskell

Science of Computer Programming

Volumn 43, Issue 2-3, 2002, Pages 93-127

  Nordlander, Johan ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

Graphical toolkit; Haskell; Polymorphism; Subtyping; Type inference

Indexed keywords

ALGORITHMS; GRAPHICAL USER INTERFACES; JAVA PROGRAMMING LANGUAGE;

POLYMORPHISM SUBTYPING;

OBJECT ORIENTED PROGRAMMING;

EID: 0036568615     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(02)00026-6     Document Type: Conference Paper

References (48)

1. Type inclusion constraints and type inference
2. On binary methods
3. Type-checking higher-order polymorphic multi-methods
4. On understanding types, data abstraction, and polymorphism
5. Fudgets - A graphical user interface in a functional language
6. Implementing graphical paradigms in TkGofer
7. Sound polymorphic type inference for objects
8. Polymorphic subtype inference: Closing the theory-practice gap
9. Type inference with subtypes
10. Syntactic properties of polymorphic subtyping
11. Type inference with extended pattern matching and subtypes
12. Using parameterized signatures to express modular structure
13. First-class polymorphism with type inference
14. Extensible records for Haskell
15. Type inference in the presence of overloading, subtyping and recursive types
16. Polymorphic type inference
17. An efficient unification algorithm
18. A theory of type polymorphism in programming
19. Coercion and type inference
20. Type inference with simple subtypes
21. Reactive objects in a functional language - An escape from the evil "I"
22. Pragmatic subtyping in polymorphic languages
23. Pizza into Java: Translating theory into practice
24. Nested types
25. Colored local type inference
26. Local type inference
27. Simplifying subtyping constraints
28. A framework for type inference with subtyping
29. Simplifying subtyping constraints
30. Minimal typings in atomic subtyping
31. Objective ML: A simple object-oriented extension of ML
32. Simple objects for standard ML
33. Principal type schemes for functional programs with overloading and subtyping
34. Type inference with constrained types
35. Subtyping constrained types
36. Simple usage polymorphism