A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Efficient algorithms for isomorphisms of simple types
2005
Mathematical Structures in Computer Science
Preserved Fulltext
The first order isomorphism problem is to decide whether two nonrecursive types using product-and function-type constructors, are isomorphic under the axioms of commutative and associative products, and currying and distributivity of functions over products. We show that this problem can be solved in
doi:10.1017/s0960129505004913
fatcat:ljnsikkmwjhanffj5t5hqopidy