A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Efficient Type Matching
[chapter]
2008
Automatic Program Development
Palsberg and Zhao (2000) presented an O(n 2 ) time algorithm for matching two recursive types; that is, deciding type isomorphism under associative-commutative type constructors. In this paper, we present an O(n log n) algorithm for matching recursive types and an O(n) algorithm for matching nonrecursive types. The linear-time algorithm for nonrecursive types works without hashing or pointer arithmetic, by employing multiset discrimination due to Paige et al.. The O(n log n) algorithm for
doi:10.1007/978-1-4020-6585-9_15
fatcat:4tf33j7wunabnakylbcveieokq