Please use this identifier to cite or link to this item:
|Title:||Understanding functional dependencies via constraint handling rules|
|Authors:||Sulzmann, M. |
|Citation:||Sulzmann, M., Duck, G.J., Peyton-Jones, S., Stuckey, P.J. (2007). Understanding functional dependencies via constraint handling rules. Journal of Functional Programming 17 (1) : 83-129. ScholarBank@NUS Repository. https://doi.org/10.1017/S0956796806006137|
|Abstract:||Functional dependencies are a popular and useful extension to Haskell style type classes. We give a reformulation of functional dependencies in terms of Constraint Handling Rules (CHRs). In previous work, CHRs have been employed for describing user-programmable type extensions in the context of Haskell style type classes. Here, we make use of CHRs to provide for the first time a concise result that under some sufficient conditions, functional dependencies allow for sound, complete and decidable type inference. The sufficient conditions imposed on functional dependencies can be very limiting. We show how to safely relax these conditions and suggest several sound extensions of functional dependencies. Our results allow for a better understanding of functional dependencies and open up the opportunity for new applications. © 2006 Cambridge University Press.|
|Source Title:||Journal of Functional Programming|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 19, 2019
WEB OF SCIENCETM
checked on Mar 4, 2019
checked on Mar 10, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.