Minerva Elements Records

Permanent URI for this collection

http://hdl.handle.net/11343/251382

Filters

2005 - 2009 49
Reset filters

Settings
Statistics
Citations
Start date: 2002 × End date: 2009 × Author: Stuckey, Peter ×

Search Results

Now showing 1 - 10 of 49
  • Item
    Thumbnail Image
    Structuring Documents Efficiently
    MARSHALL, RGJ ; BIRD, SG ; STUCKEY, PJ (University of Sydney, 2005)
  • Item
    Thumbnail Image
    Principal type inference for GHC-style multi-parameter type classes
    Sulzmann, M ; Schrijvers, T ; Stuckey, PJ ; Kobayashi, N (SPRINGER-VERLAG BERLIN, 2006)
  • 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
    Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization
    Bailey, J ; Stuckey, PJ ; Hermenegildo, M ; Cabeza, D (SPRINGER-VERLAG BERLIN, 2005)
  • Item
    Thumbnail Image
    Propagating Dense Systems of Integer Linear Equations
    Feydy, T ; Stuckey, PJ (ASSOC COMPUTING MACHINERY, 2007)
  • Item
    Thumbnail Image
    A theory of overloading
    Stuckey, PJ ; Sulzmann, M (ASSOC COMPUTING MACHINERY, 2005-11)
    We present a novel approach to allow for overloading of identifiers in the spirit of type classes. Our approach relies on a combination of the HM(X) type system framework with Constraint Handling Rules (CHRs). CHRs are a declarative language for writing incremental constraint solvers, that provide our scheme with a form of programmable type language. CHRs allow us to precisely describe the relationships among overloaded identifiers. Under some sufficient conditions on the CHRs we achieve decidable type inference and the semantic meaning of programs is unambiguous. Our approach provides a common formal basis for many type class extensions such as multiparameter type classes and functional dependencies.
  • Item
    Thumbnail Image
    Smooth Linear Approximation of Non-overlap Constraints
    Gange, G ; Marriott, K ; Stuckey, PJ ; Stapleton, G ; Howse, J ; Lee, J (SPRINGER-VERLAG BERLIN, 2008)
  • Item
    Thumbnail Image
    A framework for extended algebraic data types
    Sulzmann, M ; Wazny, J ; Stuckey, PJ ; Hagiya, M ; Wadler, P (SPRINGER, 2006)
  • Item
    Thumbnail Image
    Solving partial order constraints for LPO termination
    Codish, M ; Lagoon, V ; Stuckey, PJ ; Pfenning, F (SPRINGER-VERLAG BERLIN, 2006)
    This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take integer values and are interpreted as indices in the order. For a partial order statement on n symbols each index is represented in log2 n propositional variables and partial order constraints between symbols are modeled on the bit representations. We illustrate the application of our approach to determine LPO termination for term rewrite systems. Experimental results are unequivocal, indicating orders of magnitude speedups in comparison with current implementations for LPO termination. The proposed encoding is general and relevant to other applications which involve propositional reasoning about partial orders.