dc.contributor.author | Shafarenko, A. | |
dc.date.accessioned | 2011-10-10T15:01:12Z | |
dc.date.available | 2011-10-10T15:01:12Z | |
dc.date.issued | 2002 | |
dc.identifier.citation | Shafarenko , A 2002 , Coercion as homomorphism: type inference in a system with subtyping and overloading . in In: Procs of the 4th ACM SIGPLAN Int Conf on Principles and Practice of Declarative Programming : PPDP'02 . ACM Press , pp. 14-25 . https://doi.org/10.1145/571157.571160 | |
dc.identifier.isbn | 1-58113-528-9 | |
dc.identifier.other | dspace: 2299/1974 | |
dc.identifier.uri | http://hdl.handle.net/2299/6625 | |
dc.description.abstract | A type system with atomic subtyping and a special form of operator overloading, which we call oset-homomorphism is proposed. A set of operator overloadings is said to be oset-homomorphic when for each pair of overloadings the coercion function realises a homomorphism of types and at the same time certain conditions on the operator type signa- ture are satised. We demonstrate that oset-homomorphic overloading has sucient power for supporting a compre- hensive set of array operations in a declarative language. The problem of inferring the least types in our type system is proven to be equivalent to the shortest path problem for weighted, directed graphs with non-negative cycle weights, which has a computationally ecient solution. | en |
dc.format.extent | 160377 | |
dc.language.iso | eng | |
dc.publisher | ACM Press | |
dc.relation.ispartof | In: Procs of the 4th ACM SIGPLAN Int Conf on Principles and Practice of Declarative Programming | |
dc.title | Coercion as homomorphism: type inference in a system with subtyping and overloading | en |
dc.contributor.institution | School of Computer Science | |
dc.contributor.institution | Science & Technology Research Institute | |
rioxxterms.versionofrecord | 10.1145/571157.571160 | |
rioxxterms.type | Other | |
herts.preservation.rarelyaccessed | true | |