{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:40Z","timestamp":1725663580001},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543961"},{"type":"electronic","value":"9783540475996"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540543961_3","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:44:15Z","timestamp":1330209855000},"page":"29-49","source":"Crossref","is-referenced-by-count":2,"title":["Coercive type isomorphism"],"prefix":"10.1007","author":[{"given":"Satish R.","family":"Thatte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"V. Breazu-Tannen, T. Coquand, C. Gunter, and A. Scedrov. Inheritance and explicit coercion. In Proceedings of Fourth LICS Symposium. IEEE Computer Society Press, June 1989.","DOI":"10.1109\/LICS.1989.39166"},{"key":"3_CR2","unstructured":"H.-J. B\u00fcrkert, A. Herold, and M. Schmidt-Schau\u00df. On equational theories, unification and (un)decidability. In C. Kirchner, editor, Unification, pages 69\u2013116. Academic Press, 1990."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Luca Cardelli. Structural subtyping and the notion of power type. In Proceedings of Fifteenth POPL Symposium. ACM Press, January 1988.","DOI":"10.1145\/73560.73566"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"P-L. Curien and G. Ghelli. Coherence of subsumption. In A. Arnold, editor, Proceedings of Fifteenth Colloquium on Trees in Algebra and Programming (CAAP'90). Springer-Verlag, 1990. LNCS 431.","DOI":"10.1007\/3-540-52590-4_45"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"L. Damas and R. Milner. Principle type-schemes for functional programs. In Proceedings of Ninth POPL Symposium. ACM Press, 1982.","DOI":"10.1145\/582153.582176"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Y-C. Fuh and P. Mishra. Type inference with subtypes. In Proceedings of Second European Symposium on Programming. Springer-Verlag, 1988. LNCS 300.","DOI":"10.1007\/3-540-19027-9_7"},{"key":"3_CR7","unstructured":"You-Chin Fuh. Design and Implementation of a functional language with subtypes. PhD thesis, SUNY at Stony Brook, 1989."},{"key":"3_CR8","volume-title":"Computational Logic: Essays in Honor of Alan Robinson","author":"J. Jouannaud","year":"1991","unstructured":"Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT Press, Cambridge, MA, 1991. To appear."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Claude Kirchner. A new equational unification method: A generalization of Martelli-Montanari's algorithm. In Proceedings of 7th Conference on Automated Deduction, pages 224\u2013247. Springer-Verlag, 1984. LNCS 170.","DOI":"10.1007\/978-0-387-34768-4_14"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Paris Kanellakis and John C. Mitchell. Polymorphic unification and ML typing. In Proceedings of Sixteenth POPL Symposium. ACM Press, January 1989.","DOI":"10.1145\/75277.75286"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"John C. Mitchell. Coercion and type inference (summary). In Proceedings of Eleventh POPL Symposium, pages 175\u2013185. ACM Press, 1984.","DOI":"10.1145\/800017.800529"},{"issue":"2","key":"3_CR12","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258\u2013282, 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR13","unstructured":"H. Riis Nielson and F. Nielson. Eureka definitions for free! In Neil Jones, editor, Proceedings of Fourth European Symposium on Programming. Springer-Verlag, 1990. LNCS 432."},{"key":"3_CR14","unstructured":"Didier R\u00e9my. Algebres touffues. Application au typage polymorphe de objets enregistrements dans les langages fonctionnels. PhD thesis, Universit\u00e9 de Paris 7, 1990."},{"key":"3_CR15","unstructured":"John C. Reynolds. Preliminary design of the programming language Forsythe. Technical Report CMU-CS-88-159, Carnegie-Mellon University, Computer Science Department, June 1988."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"M. Rittri. Retrieving library identifiers via equational matching of types. In M. E. Stickel, editor, 10th Int. Conf. on Automated Deduction (CADE-10), Kaiserslautern, Germany, pages 603\u2013617. Springer-Verlag, July 1990. Lecture Notes in Artificial Intelligence, vol. 449.","DOI":"10.1007\/3-540-52885-7_117"},{"issue":"1","key":"3_CR17","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1017\/S095679680000006X","volume":"1","author":"M. Rittri","year":"1991","unstructured":"M. Rittri. Using types as search keys in function libraries. Journal of Functional Programming, 1(1):71\u201389, 1991. (Earlier version in Func. Prog. Lang. and Comp. Arch. 1989, ACM Press.).","journal-title":"Journal of Functional Programming"},{"key":"3_CR18","volume-title":"Proceedings of Fourth International Conference on Functional Programming Languages and Computer Architecture (FPCA'89)","author":"C. Runciman","year":"1989","unstructured":"C. Runciman and I. Toyn. Retrieving reusable software components by polymorphic type. In Proceedings of Fourth International Conference on Functional Programming Languages and Computer Architecture (FPCA'89), London, U.K. ACM Press, Addison-Wesley, 1989."},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"7","author":"J.H. Siekmann","year":"1989","unstructured":"J.H. Siekmann. Unification theory. Journal of Symbolic Computation, 7:207\u2013274, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"3_CR20","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0747-7171(87)80026-3","volume":"3","author":"E. Tiden","year":"1987","unstructured":"E. Tiden and S. Arnborg. Unification problems with one-sided distributivity. Journal of Symbolic Computation, 3:183\u2013202, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Satish R. Thatte. Type inference with partial types. In Timo Lepist\u00f6 and Arto Salomaa, editors, Automata, languages and programming: 15th International Colloquium (ICALP'88), pages 615\u2013629. Springer-Verlag, July 1988. LNCS 317.","DOI":"10.1007\/3-540-19488-6_146"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Satish R. Thatte. Quasi-static typing. In Proceedings of Seventeenth POPL Symposium, pages 367\u2013381. ACM Press, 1990.","DOI":"10.1145\/96709.96747"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Satish R. Thatte. Type inference and implicit scaling. In Neil Jones, editor, Proceedings of Fourth European Symposium on Programming, pages 406\u2013420. Springer-Verlag, 1990. LNCS 432 (The full version will appear in a special issue of the journal Science of Computer Programming.).","DOI":"10.1007\/3-540-52592-0_77"},{"key":"3_CR24","unstructured":"Satish R. Thatte. Unification in finite acyclic theories is unitary. in preparation, 1991."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Simon Thompson. Laws in miranda. In Proceedings of 1986 ACM Conference on LISP and Functional Programming, pages 1\u201312. ACM Press, 1986.","DOI":"10.1145\/319838.319839"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Philip Wadler. Views: A way for pattern-matching to cohabit with data abstraction. In Proceedings of Fourteenth POPL Symposium, pages 307\u2013313. ACM Press, 1987.","DOI":"10.1145\/41625.41653"},{"key":"3_CR27","unstructured":"Mitchell Wand. Complete type inference for simple objects. In Proceedings of Second LICS Symposium, pages 37\u201344. IEEE Computer Society Press, 1987."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Mitchell Wand. Type inference for record concatenation and multiple inheritance. In Proceedings of Fourth LICS Symposium, pages 92\u201397. IEEE Computer Society Press, 1989.","DOI":"10.1109\/LICS.1989.39162"}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540543961_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:58Z","timestamp":1605646438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540543961_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543961","9783540475996"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3540543961_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}