A theory of overloading

    Thumbnail
    Citations
    Scopus
    Web of Science
    Altmetric
    38
    13
    Author
    Stuckey, PJ; Sulzmann, M
    Date
    2005-11-01
    Source Title
    ACM Transactions on Programming Languages and Systems
    Publisher
    ASSOC COMPUTING MACHINERY
    University of Melbourne Author/s
    Stuckey, Peter
    Affiliation
    Computer Science and Software Engineering
    Metadata
    Show full item record
    Document Type
    Journal Article
    Citations
    Stuckey, P. J. & Sulzmann, M. (2005). A theory of overloading. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 27 (6), pp.1216-1269. https://doi.org/10.1145/1108970.1108974.
    Access Status
    This item is currently not available from this repository
    URI
    http://hdl.handle.net/11343/31708
    DOI
    10.1145/1108970.1108974
    Abstract
    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.
    Keywords
    Computer Software; Information Systems

    Export Reference in RIS Format     

    Collections