dc.contributor.author | Shafarenko, A. | |
dc.date.accessioned | 2007-10-04T10:55:53Z | |
dc.date.available | 2007-10-04T10:55:53Z | |
dc.date.issued | 2004 | |
dc.identifier.citation | Shafarenko , A 2004 , General homomorphic overloading . in Implementation and Application of Functional Languages : 16th International Workshop, IFL 2004, Lübeck, Germany, September 8-10, 2004 Revised Selected Papers . Lecture Notes in Computer Science , vol. 3474 , Springer Nature , pp. 195-210 . https://doi.org/10.1007/11431664_12 | |
dc.identifier.isbn | 978-3-540-32038-8 | |
dc.identifier.other | PURE: 1799630 | |
dc.identifier.other | PURE UUID: 0f0c6869-9833-4c60-8593-a549d77287c3 | |
dc.identifier.other | dspace: 2299/847 | |
dc.identifier.other | Scopus: 24944514074 | |
dc.identifier.uri | http://hdl.handle.net/2299/847 | |
dc.description.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’s algebraic path method’s cubic complexity | en |
dc.language.iso | eng | |
dc.publisher | Springer Nature | |
dc.relation.ispartof | Implementation and Application of Functional Languages | |
dc.relation.ispartofseries | Lecture Notes in Computer Science | |
dc.title | General homomorphic overloading | en |
dc.contributor.institution | School of Computer Science | |
dc.contributor.institution | Science & Technology Research Institute | |
rioxxterms.version | AM | |
rioxxterms.versionofrecord | https://doi.org/10.1007/11431664_12 | |
rioxxterms.type | Other | |
herts.preservation.rarelyaccessed | true | |