- Computing and Information Systems - Research Publications
Computing and Information Systems - Research Publications
Permanent URI for this collection
7 results
Filters
Reset filtersSettings
Statistics
Citations
Search Results
Now showing
1 - 7 of 7
-
ItemOptimizing compilation of CHR with rule prioritiesDe Koninck, L ; Stuckey, PJ ; Duck, GJ ; Garrigue, J ; Hermenegildo, M (Springer, 2008-05-14)
-
ItemObservable confluence for constraint handling rulesDuck, GJ ; Stuckey, PJ ; Sulzmann, M ; Dahl, V ; Niemela, I (SPRINGER-VERLAG BERLIN, 2007)
-
ItemAbstract interpretation for constraint handling rulesSCHRIJVERS, T. ; STUCKEY, P. ; DUCK, G. (ACM Press, 2005)
-
ItemMiniZinc: Towards a Standard CP Modelling LanguageNETHERCOTE, N. ; STUCKEY, P. ; BECKET, R. ; BRAND, S. ; DUCK, G. ; TACK, G. (Springer Verlag, 2007)
-
ItemACD Term RewritingDuck, GJ ; Stuckey, PJ ; Brand, S ; Etalle, S ; Truszczynski, M (SPRINGER-VERLAG BERLIN, 2006)
-
ItemUnderstanding functional dependencies via constraint handling rulesSulzmann, 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.
-
ItemDemand-Driven Normalisation for ACD Term RewritingDe Koninck, L ; Duck, GJ ; Stuckey, PJ ; Hill, PM ; Warren, DS (Springer, 2009-09-14)ACD Term Rewriting (ACDTR) is term rewriting modulo associativity, commutativity, and a limited form of distributivity called conjunctive context. Previous work presented an implementation for ACDTR based on bottom-up eager normalisation, extended to support the conjunctive context. This paper investigates the possibility of using a demand-driven normalisation strategy for ACDTR. Again, dealing with the conjunctive context proves to be challenging. The alternative normalisation strategy is compared with the current form of eager normalisation and potential further improvements on the strategy are investigated.