Understanding functional dependencies via constraint handling rules
AuthorSulzmann, M; Duck, GJ; Peyton-Jones, S; Stuckey, PJ
Source TitleJournal of Functional Programming
PublisherCAMBRIDGE UNIV PRESS
AffiliationComputer Science and Software Engineering
Document TypeJournal Article
CitationsSulzmann, M., Duck, G. J., Peyton-Jones, S. & Stuckey, P. J. (2007). Understanding functional dependencies via constraint handling rules. JOURNAL OF FUNCTIONAL PROGRAMMING, 17 (1), pp.83-129. https://doi.org/10.1017/S0956796806006137.
Access StatusThis item is currently not available from this repository
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.
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References