@inproceedings{0f0c686998334c608593a549d77287c3,
title = "General homomorphic overloading",
abstract = "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{\textquoteright}s algebraic path method{\textquoteright}s cubic complexity",
author = "A. Shafarenko",
year = "2004",
doi = "10.1007/11431664_12",
language = "English",
series = "Lecture Notes in Computer Science",
publisher = "Springer Nature",
pages = "195--210",
booktitle = "Implementation and Application of Functional Languages",
address = "Netherlands",
}