Abstract
Palsberg and Zhao [17] presented an O(n2) time algorithm for matching two recursive types. In this paper, we present an O(n log n) algorithm for the same problem. Our algorithm works by reducing the type matching problem to the well-understood problem of finding a size-stable partition of a graph. Our result may help improve systems, such as Polyspin and Mockingbird, that are designed to facilitate interoperability of software components.We also discuss possible applications of our algorithm to Java. Issues related to subtyping of recursive types are also discussed.
Cite
CITATION STYLE
Jha, S., Palsberg, J., & Zhao, T. (2002). Efficient type matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2303, pp. 187–204). Springer Verlag. https://doi.org/10.1007/978-1-4020-6585-9_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
