Show simple item record

dc.contributor.authorVolpano, Dennis
dc.dateMay 1994.
dc.date.accessioned2013-08-20T16:44:14Z
dc.date.available2013-08-20T16:44:14Z
dc.date.issued1994-05
dc.identifier.citationProceedings 1994 Int'l Conference on Computer Languages, Toulouse, France, pp. 88-94, May 1994.
dc.identifier.urihttp://hdl.handle.net/10945/35271
dc.descriptionThe article of record as published may be found at http://dx.doi.org/en_US
dc.description.abstractExtensions of the ML type system, based on constrained type schemes, have been proposed for languages with overloading. Type inference in these systems requires solving the following satisfiability problems. Given a set of type assumptions C over finite types, and a type basis A, is there is a substitution S that satisfies C in that A 1- CS is derivable? Under arbitrary overloading, the problem is undecidable. Haskell limits overloading to a form similar to that proposed by Keas called parametric overloading. We formally characterize parametric overloading in terms of a regular tree language and prove that although decidable, satisfiability is NP-hard when overloading is parametric.en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleHaskell-style Overloading is NP Harden_US
dc.contributor.departmentComputer Science (CS)


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record