{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:00:05Z","timestamp":1760043605405},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617396"},{"type":"electronic","value":"9783540706748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61739-6_52","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:19:09Z","timestamp":1330294749000},"page":"349-365","source":"Crossref","is-referenced-by-count":28,"title":["Subtyping constrained types"],"prefix":"10.1007","author":[{"given":"Valery","family":"Trifonov","sequence":"first","affiliation":[]},{"given":"Scott","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. L. Wimmers. Type inclusion constraints and type inference. In Proceedings of the International Conference on Functional Programming Languages and Computer Architecture, pages 31\u201341, 1993.","DOI":"10.1145\/165180.165188"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"A. Aiken, E. L. Wimmers, and T. K. Lakshman. Soft typing with conditional types. In Conference Record of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, pages 163\u2013173, 1994.","DOI":"10.1145\/174675.177847"},{"issue":"4","key":"24_CR3","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/155183.155231","volume":"15","author":"R. Amadio","year":"1993","unstructured":"R. Amadio and L. Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575\u2013631, September 1993. Extended abstract in POPL 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"24_CR4","unstructured":"Fran\u00c7ois Bourdoncle and Stephan Merz. On the integration of functional programming, class-based object-oriented programming, and multi-methods. Technical Report 26, Centre des Math\u00e9matiques Appliqu\u00e9es, Ecole des Mines de Paris, 1996. Available at http:\/\/www.ensmp.fr\/~bourdonc\/."},{"issue":"3","key":"24_CR5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/j.1096-9942.1995.tb00019.x","volume":"1","author":"K. Bruce","year":"1995","unstructured":"Kim Bruce, Luca Cardelli, Giuseppe Castagna, The Hopkins Objects Group, Gary T. Leavens, and Benjamin Pierce. On binary methods. Theory and Practice of Object Systems, 1(3):217\u2013238, 1995.","journal-title":"Theory and Practice of Object Systems"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"L. Cardelli. A semantics of multiple inheritance. In Semantics of Data Types, volume 173 of Lecture notes in Computer Science, pages 51\u201367. Springer-Verlag, 1984.","DOI":"10.1007\/3-540-13346-1_2"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95\u2013169, 1983.","journal-title":"Theoretical Computer Science"},{"key":"24_CR8","unstructured":"Pavel Curtis. Constrained quantification in polymorphic type analysis. Technical Report CSL-90-1, XEROX Palo Alto Research Center, CSLPubs.parc@xerox. com, 1990."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"J. Eifrig, S. Smith, and V. Trifonov. Sound polymorphic type inference for objects. In OOPSLA '95, pages 169\u2013184, 1995.","DOI":"10.1145\/217838.217858"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"J. Eifrig, S. Smith, and V. Trifonov. Type inference for recursively constrained types and its application to OOP. In Proceedings of the 1995 Mathematical Foundations of Programming Semantics Conference, volume 1 of Electronic Notes in Theoretical Computer Science. Elsevier, 1995. http: \/\/www.elsevier.nl\/locate\/entes\/volume1.html.","DOI":"10.1016\/S1571-0661(04)80008-2"},{"issue":"4","key":"24_CR11","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF01018829","volume":"8","author":"J. Eifrig","year":"1995","unstructured":"J. Eifrig, S. Smith, V. Trifonov, and A. Zwarico. An interpretation of typed OOP in a language with state. Lisp and Symbolic Computation, 8(4):357\u2013397, 1995.","journal-title":"Lisp and Symbolic Computation"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Y.-C. Fuh and P. Mishra. Type inference with subtypes. In European Symposium on Programming, 1988.","DOI":"10.1007\/3-540-19027-9_7"},{"key":"24_CR13","unstructured":"Trevor Jim. Principal typings and type inference. PhD thesis, MIT, 1996. (to appear)."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"S. Kaes. Type inference in the presence of overloading, subtyping and recursive types. In ACM Conference on Lisp and Functional Programming, pages 193\u2013204, 1992.","DOI":"10.1145\/141471.141540"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0019-9958(86)80019-5","volume":"71","author":"D. B. MacQueen","year":"1986","unstructured":"D. B. MacQueen, G. Plotkin, and R. Sethi. An ideal model for recursive polymorphic types. Information and Control, 71:95\u2013130, 1986.","journal-title":"Information and Control"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"P. Mishra and U. Reddy. Declaration-free type checking. In Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 7\u201321, 1985.","DOI":"10.1145\/318593.318603"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"John C. Mitchell. Coercion and type inference (summary). In Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984.","DOI":"10.1145\/800017.800529"},{"key":"24_CR18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1017\/S0956796800000113","volume":"1","author":"J. C. Mitchell","year":"1991","unstructured":"John C. Mitchell. Type inference with simple subtypes. Journal of Functional Programming, 1:245\u2013285, 1991.","journal-title":"Journal of Functional Programming"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Jens Palsberg and Scott Smith. Constrained types and their expressiveness. TOPLAS, 18(5), September 1996.","DOI":"10.1145\/232706.232715"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Fran\u00c7ois Pottier. Simplifying subtyping constraints. In First International Conference on Functional Programming, pages 122\u2013133, 1996.","DOI":"10.1145\/232629.232642"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Geoffrey S. Smith. Principal type schemes for functional programs with overloading and subtyping. Science of Computer Programming, 23, 1994.","DOI":"10.1016\/0167-6423(94)00020-4"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61739-6_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:36:14Z","timestamp":1619573774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61739-6_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617396","9783540706748"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-61739-6_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}