|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/6854
| Title: | Overloading and Bounded Polymorphism |
| Authors: | Smith, Geoffrey S. |
| Keywords: | computer science
technical report |
| Issue Date: | Nov-1989 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1054 |
| Abstract: | We present an extension of the Hindley/Milner polymorphic type system that deals with overloading. The system uses a kind of bounded polymorphic type to describe the nonuniform polymorphism resulting from the use of overloaded identifiers. We consider the type inference problem for our system and show that it is undecidable. Restrictions are proposed to cope with this limitation. |
| URI: | http://hdl.handle.net/1813/6854 |
| Appears in Collections: | Computer Science Technical Reports
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
