Wadler, P. and Blott, S. (1989). How to make ad-hoc polymorphism less ad hoc. In 16'th Symposium on Principles of Programming Languages, Austin, Texas. ACM Press.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
To the Gates of HAL: a HAL tutorial - Banda, Demoen, Marriott, Stuckey (2002) (Correct)
....impure predicates it is considered pure) Note that all constraints are in some sense impure since they change the constraint store. However, for a correct solver, they act and should be treated as logically pure. 4 Constraint Solvers and Type Classes As we have seen HAL provides type classes [17, 21]. These support constrained polymorphism by allowing the programmer to write code which relies on a parametric type having certain associated predicates and functions. More precisely, a type class is a name for a set of types for which certain predicates and or functions, called the methods, are ....
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Proc. 16th ACM POPL, pages 60-76, 1989.
Object-Oriented Programs - Tr July Fl (Correct)
....need to update code to work with objects of new types [Cox86] Each object in such a language contains both data and a table of operations called a method dictionary. An object s method dictionary maps message names to the operations (code) that implements the named operations for a given type [WB89]. Since the method dictionary is accessible from the objects, code that invokes an object s operations does not have to depend on the types of objects. For example, one does not write IntSet ins(s,e) to insert an integer e into a set s, as one would in CLU; For space efficiency, in most ....
....sort[Int] as one might write in CLU [LAB 81] or Ada [Ada83] In ML [GMW79] type parameters are implicit, but one must pass the operations that would go in the method dictionary explicitly. The polymorphism that results from forms of overloading can also be explained by method dictionaries [WB89]. An operation name, such as , is overloaded if the same name will invoke different operations depending on the types of its arguments. For example, in a language where arithmetic operators like can mean either integer or floating point operations, one can write expressions such as a b, and the ....
Philip Wadler and Stephen Blott. How to make ad-hoc Polymorphism less ad hoc. In Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 60--76. ACM, January 1989.
Implementing Overloading and Polymorphism in Cforall - Bilson (2003) (Correct)
....by that class (using an instance declaration) the Haskell system does not search for in scope declarations for each assertion. Instead, it simply ensures that an instance declaration has already supplied a set of operations for the particular combination of type and class. Wadler and Blott [37] show how resolving uses of type classes can be implemented as a preprocessor before an application of Algorithm W to infer principal types, although their overloading rules result in the same sort of undecidability as is found in the assertion satisfaction algorithm presented here [34] ....
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad hoc. In Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 60--76. ACM Press, 1989.
Unknown - Type Prod List (Correct)
No context found.
Wadler, P. and Blott, S. (1989). How to make ad-hoc polymorphism less ad hoc. In 16'th Symposium on Principles of Programming Languages, Austin, Texas. ACM Press.
Algorithm Specialization in Generic Programming -.. - Järvi, Gregor.. (2006) (Correct)
No context found.
P. Wadler and S. Blott. How to make ad-hoc polymorphism less adhoc. In ACM Symposium on Principles of Programming Languages, pages 60--76. ACM, January 1989.
Compiling Polymorphism Using Intensional Type - Analysis Robert Harper (Correct)
No context found.
Philip Wadler and Stephen Blott. How to make ad hoc polymorphism less ad hoc. In Sixteenth ACM Symposium on Principles of Programming Languages, pages 60--76. ACM, January 1989.
Concepts: Linguistic Support for Generic Programming in C++ - Douglas Gregor Dgregor (Correct)
No context found.
P. Wadler and S. Blott. How to make ad-hoc polymorphism less adhoc. In ACM Symposium on Principles of Programming Languages, pages 60--76. ACM, January 1989.
Compiling with Non-Parametric Polymorphism - Preliminary Report Robert (Correct)
No context found.
P. Wadler and S. Blott. How to make ad hoc polymorphism less ad hoc. In Conference Record of the 16th Annual ACM Symposium on Principles of Programming Languages, pages 60--76, Austin, Texas, 1989.
Modular Type Classes - Derek Dreyer Toyota (2006) (Correct)
No context found.
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In POPL '89.
Modular Type Classes - Derek Dreyer Toyota (2006) (Correct)
No context found.
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In POPL '89.
An Open and Shut Typecase - Vytiniotis, Washburn, Weirich (2004) (3 citations) (Correct)
No context found.
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Sixteenth ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 60--76. ACM Press, 1989.
A Lightweight Implementation of Generics and Dynamics - Cheney, Hinze (2002) (13 citations) (Correct)
No context found.
Philip Wadler and Stephen Blott. How to make ad-hoc polymorphism less ad hoc. In Proceedings of the 16th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '89), pages 60--76, Austin, TX, USA, January 1989. ACM Press.
Studies in Computer Aided Verification of Protocols - Griffioen (2000) (Correct)
No context found.
Philip Wadler and Stephen Blott. How to make ad-hoc polymorphism less ad hoc. In 16'th ACM Symposium on Principles of Programming Languages, Austin, Texas, January 1989.
Fusion in Practice - Diederik Van Arkel (2003) (1 citation) (Correct)
No context found.
P. Wadler, S. Blott. How to make ad-hoc polymorphism less ad hoc In Proceedings 16th ACM Symposium on Principles of Programming Languages, pages 60--76, 1989.
Type-Safe Cast: Functional Pearl - Weirich (2000) (13 citations) (Correct)
No context found.
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Sixteenth ACM Symposium on Principles of Programming Languages, pages 60-76. ACM, 1989.
A Design for Type-Directed Programming in Java - Weirich, Huang (2004) (Correct)
No context found.
Philip Wadler and Stephen Blott. How to make ad-hoc polymorphism less ad hoc. In Sixteenth ACMSIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 60--76. ACM Press, 1989.
Free Theorems in the Presence of seq - Johann, Voigtländer (2004) (2 citations) (Correct)
No context found.
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad hoc. In POPL'89, Proc., pages 60--76. ACM Press.
Haskell and Principal Types - Faxen (2003) (Correct)
No context found.
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad hoc. In 16th ACM Symposium on Principles of Programming Languages, pages 60--76, 1989.
The Logical Framework of - Radu Grosu Franz (Correct)
No context found.
P.Wadler and S. Blott. HowtoMake Ad-hoc Polymorphism Less Ad hoc. In 16th ACM Symposium on Principles of Programming Languages, pages 60--76, 1989. 37
Unifying Nominal and Structural Ad-hoc Polymorphism - Washburn, Weirich (2004) (Correct)
No context found.
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Sixteenth ACMSIGPLANSIGACT Symposium on Principles of Programming Languages, pages 60--76. ACM Press, 1989.
A Universally Polymorphic Specification Language - A Brief.. - Nazareth (1993) (2 citations) (Correct)
No context found.
Philip Wadler and S. Blott. HowtoMake Ad-hoc Polymorphism Less Ad hoc. In 16th ACM Symposium on Principles of Programming Languages, pages 60--76, 1989. 16
A Theory of Overloading Part II: Semantics and Coherence - Andreas Rossberg Martin (2002) (Correct)
No context found.
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Proc. 16th ACM Symposium on Principles of Programming Languages (POPL), pages 60-76, January 1989. 14
Higher-Order Intensional Type Analysis in Type-Erasure Semantics - Weirich (2003) (3 citations) (Correct)
No context found.
Philip Wadler and Stephen Blott. How to make ad-hoc polymorphism less ad-hoc. In Sixteenth ACMSIGPLANSIGACT Symposium on Principles of Programming Languages, pages 60--76. ACM Press, 1989.
An Open and Shut Typecase - Vytiniotis, Washburn, Weirich (2004) (3 citations) (Correct)
No context found.
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Sixteenth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 60--76. ACM Press, 1989.
A Theory of Overloading - Stuckey, Sulzmann (2002) (Correct)
No context found.
P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Proc. of POPL'89, pages 60-76, 1989.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC