{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:57Z","timestamp":1759638897248},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255932"},{"type":"electronic","value":"9783540320142"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11417170_14","type":"book-chapter","created":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T19:29:35Z","timestamp":1292527775000},"page":"179-193","source":"Crossref","is-referenced-by-count":7,"title":["Subtyping Recursive Types Modulo Associative Commutative Products"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Di Cosmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Pottier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didier","family":"R\u00e9my","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fiore, M.P.: Syntactic considerations on recursive types. In: IEEE Symposium on Logic in Computer Science (LICS), pp. 242\u2013252 (July 1996)","DOI":"10.1109\/LICS.1996.561324"},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/155183.155231","volume":"15","author":"R.M. Amadio","year":"1993","unstructured":"Amadio, R.M., Cardelli, L.: Subtyping recursive types. ACM Transactions on Programming Languages and Systems\u00a015(4), 575\u2013631 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/3-540-61756-6_95","volume-title":"Symposium on Programming Language Implementation and Logic Programming (PLILP)","author":"M.-V. Aponte","year":"1996","unstructured":"Aponte, M.-V., Di Cosmo, R.: Type isomorphisms for module signatures. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol.\u00a01140, pp. 334\u2013346. Springer, Heidelberg (1996)"},{"key":"14_CR4","unstructured":"Auerbach, J., Barton, C., Raghavachari, M.: Type isomorphisms with recursive types. Technical Report RC 21247, IBM Yorktown Heights (1998)"},{"key":"14_CR5","unstructured":"Auerbach, J., Chu-Carrol, M.C.: The Mockingbird system: a compiler-based approach to maximally interoperable distributed systems. Technical Report RC 20718, IBM Yorktown Heights (1997)"},{"key":"14_CR6","unstructured":"Auerbach, J., Chu-Carrol, M.C., Barton, C., Raghavachari, M.: Mockingbird: Flexible stub generation from pairs of declarations. Technical Report RC 21309, IBM Yorktown Heights (1998)"},{"key":"14_CR7","unstructured":"Balat, V., Di Cosmo, R., Fiore, M.: Remarks on isomorphisms in typed lambda calculi with empty and sum type. In: IEEE Symposium on Logic in Computer Science (LICS) (July 2002)"},{"key":"14_CR8","unstructured":"Barton, C.M.: M-types and their coercions. Technical Report RC-21615, IBM Yorktown Heights (December 1999)"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.3233\/FI-1998-33401","volume":"33","author":"M. Brandt","year":"1998","unstructured":"Brandt, M., Henglein, F.: Coinductive axiomatization of recursive type equality and subtyping. Fundamenta Informatic\u00e6\u00a033, 309\u2013338 (1998)","journal-title":"Fundamenta Informatic\u00e6"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1017\/S0960129500001444","volume":"2","author":"K. Bruce","year":"1992","unstructured":"Bruce, K., Di Cosmo, R., Longo, G.: Provable isomorphisms of types. Mathematical Structures in Computer Science\u00a02(2), 231\u2013247 (1992)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1-2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/S0304-3975(01)00298-5","volume":"275","author":"F. Cardone","year":"2002","unstructured":"Cardone, F.: A coinductive completeness proof for the equivalence of recursive types. Theoretical Computer Science\u00a0275(1-2), 575\u2013587 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science\u00a025(2), 95\u2013169 (1983)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1017\/S0956796800000861","volume":"3","author":"R. Cosmo Di","year":"1993","unstructured":"Di Cosmo, R.: Deciding type isomorphisms in a type assignment framework. Journal of Functional Programming\u00a03(3), 485\u2013525 (1993)","journal-title":"Journal of Functional Programming"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Di Cosmo, R.: Isomorphisms of types: from \u03bb-calculus to information retrieval and language design. In: Progress in Theoretical Computer Science. Birkhauser, Basel (1995)","DOI":"10.1007\/978-1-4612-2572-0"},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/322217.322228","volume":"27","author":"P.J. Downey","year":"1980","unstructured":"Downey, P.J., Sethi, R., Tarjan, R.E.: Variations on the common subexpression problem. Journal of the ACM\u00a027(4), 758\u2013771 (1980)","journal-title":"Journal of the ACM"},{"issue":"6","key":"14_CR16","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1017\/S0956796802004318","volume":"12","author":"V. Gapeyev","year":"2003","unstructured":"Gapeyev, V., Levin, M., Pierce, B.: Recursive subtyping revealed. Journal of Functional Programming\u00a012(6), 511\u2013548 (2003)","journal-title":"Journal of Functional Programming"},{"issue":"4","key":"14_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-45931-6_14","volume-title":"Foundations of Software Science and Computation Structures","author":"S. Jha","year":"2002","unstructured":"Jha, S., Palsberg, J., Zhao, T.: Efficient type matching. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 187\u2013204. Springer, Heidelberg (2002)"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1006\/inco.2001.3090","volume":"171","author":"J. Palsberg","year":"2001","unstructured":"Palsberg, J., Zhao, T.: Efficient and flexible matching of recursive types. Information and Computation\u00a0171, 364\u2013387 (2001)","journal-title":"Information and Computation"},{"issue":"1","key":"14_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1017\/S095679680000006X","volume":"1","author":"M. Rittri","year":"1991","unstructured":"Rittri, M.: Using types as search keys in function libraries. Journal of Functional Programming\u00a01(1), 71\u201389 (1991)","journal-title":"Journal of Functional Programming"},{"issue":"6","key":"14_CR21","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1051\/ita\/1993270605231","volume":"27","author":"M. Rittri","year":"1993","unstructured":"Rittri, M.: Retrieving library functions by unifying types modulo linear isomorphism. RAIRO Theoretical Informatics and Applications\u00a027(6), 523\u2013540 (1993)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"issue":"2","key":"14_CR22","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1017\/S0956796800020049","volume":"1","author":"C. Runciman","year":"1991","unstructured":"Runciman, C., Toyn, I.: Retrieving re-usable software components by polymorphic type. Journal of Functional Programming\u00a01(2), 191\u2013211 (1991)","journal-title":"Journal of Functional Programming"},{"issue":"3","key":"14_CR23","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1007\/BF01084396","volume":"22","author":"S.V. Soloviev","year":"1983","unstructured":"Soloviev, S.V.: The category of finite sets and cartesian closed categories. Journal of Soviet Mathematics\u00a022(3), 1387\u20131400 (1983)","journal-title":"Journal of Soviet Mathematics"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Thatt\u00e9, S.R.: Automated synthesis of interface adapters for reusable classes. In: ACM Symposium on Principles of Programming Languages (POPL), January 1994, pp. 174\u2013187 (1994)","DOI":"10.1145\/174675.177850"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Wing, J.M., Rollins, E., Zaremski, A.M.: Thoughts on a Larch\/ML and a new application for LP. In: First International Workshop on Larch, July 1992, pp. 297\u2013312 (1992)","DOI":"10.1007\/978-1-4471-3558-6_17"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11417170_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T19:26:41Z","timestamp":1592162801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11417170_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255932","9783540320142"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11417170_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}