Computing and Information Systems - Research Publications

Permanent URI for this collection

Search Results

Now showing 1 - 6 of 6
  • Item
    Thumbnail Image
    Optimizing compilation of CHR with rule priorities
    De Koninck, L ; Stuckey, PJ ; Duck, GJ ; Garrigue, J ; Hermenegildo, M (Springer, 2008-05-14)
  • Item
    Thumbnail Image
    Observable confluence for constraint handling rules
    Duck, GJ ; Stuckey, PJ ; Sulzmann, M ; Dahl, V ; Niemela, I (SPRINGER-VERLAG BERLIN, 2007)
  • Item
    Thumbnail Image
    Abstract interpretation for constraint handling rules
    SCHRIJVERS, T. ; STUCKEY, P. ; DUCK, G. (ACM Press, 2005)
  • Item
    Thumbnail Image
    MiniZinc: Towards a Standard CP Modelling Language
    NETHERCOTE, N. ; STUCKEY, P. ; BECKET, R. ; BRAND, S. ; DUCK, G. ; TACK, G. (Springer Verlag, 2007)
  • Item
    Thumbnail Image
    ACD Term Rewriting
    Duck, GJ ; Stuckey, PJ ; Brand, S ; Etalle, S ; Truszczynski, M (SPRINGER-VERLAG BERLIN, 2006)
  • Item
    Thumbnail Image
    Understanding functional dependencies via constraint handling rules
    Sulzmann, M ; Duck, GJ ; Peyton-Jones, S ; Stuckey, PJ (CAMBRIDGE UNIV PRESS, 2007-01)
    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.