Qualified types: theory and practice (ordering relation)
- Author:
- Mark Philip Jones
Abstract
No abstract available.
Cited By
Winant T and Devriese D (2018). Coherent explicit dictionary application for Haskell, ACM SIGPLAN Notices, 53:7, (81-93), Online publication date: 7-Dec-2018.- Winant T and Devriese D Coherent explicit dictionary application for Haskell Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell, (81-93)
- Haftmann F and Nipkow T Code generation via higher-order rewrite systems Proceedings of the 10th international conference on Functional and Logic Programming, (103-117)
- Vytiniotis D, Peyton Jones S and Schrijvers T Let should not be generalized Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation, (39-50)
- Chen K, Weng S, Wang M, Khoo S and Chen C A compilation model for aspect-oriented polymorphically typed functional languages Proceedings of the 14th international conference on Static Analysis, (34-51)
- Stuckey P and Sulzmann M (2005). A theory of overloading, ACM Transactions on Programming Languages and Systems (TOPLAS), 27:6, (1216-1269), Online publication date: 1-Nov-2005.
- Stuckey P and Sulzmann M A theory of overloading Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, (167-178)
- Stuckey P and Sulzmann M (2002). A theory of overloading, ACM SIGPLAN Notices, 37:9, (167-178), Online publication date: 17-Sep-2002.
- Launchbury J, Lewis J and Cook B On embedding a microarchitectural design language within Haskell Proceedings of the fourth ACM SIGPLAN international conference on Functional programming, (60-69)
- Launchbury J, Lewis J and Cook B (1999). On embedding a microarchitectural design language within Haskell, ACM SIGPLAN Notices, 34:9, (60-69), Online publication date: 1-Sep-1999.
- Crary K Foundations for the implementation of higher-order subtyping Proceedings of the second ACM SIGPLAN international conference on Functional programming, (125-135)
- Crary K (1997). Foundations for the implementation of higher-order subtyping, ACM SIGPLAN Notices, 32:8, (125-135), Online publication date: 1-Aug-1997.
- Odersky M and Läufer K Putting type annotations to work Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (54-67)
- Odersky M, Wadler P and Wehr M A second look at overloading Proceedings of the seventh international conference on Functional programming languages and computer architecture, (135-146)
- Thatté S Semantics of type classes revisited Proceedings of the 1994 ACM conference on LISP and functional programming, (208-219)
- Thatté S (1994). Semantics of type classes revisited, ACM SIGPLAN Lisp Pointers, VII:3, (208-219), Online publication date: 1-Jul-1994.
- Peterson J and Jones M Implementing type classes Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation, (227-236)
- Jones M A system of constructor classes Proceedings of the conference on Functional programming languages and computer architecture, (52-61)
- Peterson J and Jones M (2019). Implementing type classes, ACM SIGPLAN Notices, 28:6, (227-236), Online publication date: 1-Jun-1993.
Recommendations
Qualified types for MLF
Proceedings of the tenth ACM SIGPLAN international conference on Functional programmingMLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a local type annotation is required. Qualified types are a general concept that ...
Qualified types for MLF
ICFP '05: Proceedings of the tenth ACM SIGPLAN international conference on Functional programmingMLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a local type annotation is required. Qualified types are a general concept that ...
Boxy types: inference for higher-rank types and impredicativity
ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programmingLanguages 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 annotations. In this paper we show, for the first time, how to combine the ...