C. M. Barton. M-types and their coercions. Technical Report RC-21615, IBM Yorktown Heights, Dec. 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Subtyping Recursive Types modulo Associative Commutative.. - Di Cosmo, Pottier, Remy (2003) (Correct)
....7] or PolySpin [21] These active areas are currently attracting the attention of many researchers. Unfortunately, the general problem of characterizing isomorphic types for a full fledged type system, including sums, products, polymorphic and recursive types such as that underlying Mockingbird [5, 9] is extremely complex and remains open; see [1] for the difficulties with recursive types and [8] for recent advances concerning sum types. In view of this difficulty, Jha, Palsberg, and Zhao [22, 20] proposed in 2000 to study a weak approximation of isomorphisms of recursive types, obtained by ....
C. M. Barton. M-types and their coercions. Technical Report RC-21615, IBM Yorktown Heights, Dec. 1999.
Subtyping Recursive Types modulo Associative Commutative.. - Di Cosmo, Pottier, Remy (2003) (Correct)
....7] or PolySpin [21] These active areas are currently attracting the attention of many researchers. Unfortunately, the general problem of characterizing isomorphic types for a full fledged type system, including sums, products, polymorphic and recursive types such as that underlying Mockingbird [5, 9] is extremely complex and remains open; see [1] for the difficulties with recursive types and [8] for recent advances concerning sum types. In view of this difficulty, Jha, Palsberg and Zhao [22, 20] propose to study a simple approximation of isomorphisms of recursive types, obtained by viewing ....
C. M. Barton. M-types and their coercions. Technical Report RC-21615, IBM Yorktown Heights, Dec. 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC