General homomorphic overloading

A. Shafarenko

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    35 Downloads (Pure)


    A general homomorphic overloading in a first-order type system is discussed and its attendant subtype inference problem is formulated. We propose a computationally efficient type inference algorithm by converting the attendant constraint-satisfaction problem into the algebraic path problem for a constraint graph weighted with elements of a specially constructed non-commutative star semiring. The elements of the semiring are monotonic functions from integers to integers (including ±∞) with pointwise maximum and function composition as semiring operations. The computational efficiency of our method is due to Kleene’s algebraic path method’s cubic complexity
    Original languageEnglish
    Title of host publicationImplementation and Application of Functional Languages
    Subtitle of host publication16th International Workshop, IFL 2004, Lübeck, Germany, September 8-10, 2004 Revised Selected Papers
    PublisherSpringer Nature
    ISBN (Electronic)978-3-540-32038-8
    Publication statusPublished - 2004

    Publication series

    NameLecture Notes in Computer Science


    Dive into the research topics of 'General homomorphic overloading'. Together they form a unique fingerprint.

    Cite this