University Library
  • Login
A gateway to Melbourne's research publications
Minerva Access is the University's Institutional Repository. It aims to collect, preserve, and showcase the intellectual output of staff and students of the University of Melbourne for a global audience.
View Item 
  • Minerva Access
  • Engineering
  • Computing and Information Systems
  • Computing and Information Systems - Research Publications
  • View Item
  • Minerva Access
  • Engineering
  • Computing and Information Systems
  • Computing and Information Systems - Research Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

    Understanding functional dependencies via constraint handling rules

    Thumbnail
    Citations
    Scopus
    Web of Science
    Altmetric
    43
    29
    Author
    Sulzmann, M; Duck, GJ; Peyton-Jones, S; Stuckey, PJ
    Date
    2007-01-01
    Source Title
    JOURNAL OF FUNCTIONAL PROGRAMMING
    Publisher
    CAMBRIDGE UNIV PRESS
    University of Melbourne Author/s
    DUCK, GREGORY; Stuckey, Peter
    Affiliation
    Computer Science and Software Engineering
    Metadata
    Show full item record
    Document Type
    Journal Article
    Citations
    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), pp.83-129. https://doi.org/10.1017/S0956796806006137.
    Access Status
    This item is currently not available from this repository
    URI
    http://hdl.handle.net/11343/29393
    DOI
    10.1017/S0956796806006137
    Abstract
    <jats:title>Abstract</jats:title><jats:p>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.</jats:p>
    Keywords
    Computer Software

    Export Reference in RIS Format     

    Endnote

    • Click on "Export Reference in RIS Format" and choose "open with... Endnote".

    Refworks

    • Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References


    Collections
    • Minerva Elements Records [45689]
    • Computing and Information Systems - Research Publications [1454]
    Minerva AccessDepositing Your Work (for University of Melbourne Staff and Students)NewsFAQs

    BrowseCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects
    My AccountLoginRegister
    StatisticsMost Popular ItemsStatistics by CountryMost Popular Authors