{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:30:39Z","timestamp":1648560639466},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4580,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s0167-6423(00)00013-7","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T16:12:04Z","timestamp":1036080724000},"page":"57-92","source":"Crossref","is-referenced-by-count":1,"title":["Finite subtype inference with explicit polymorphism"],"prefix":"10.1016","volume":"39","author":[{"given":"Dominic","family":"Duggan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(00)00013-7_BIB1","series-title":"A Theory of Objects","author":"Abadi","year":"1996"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB2","doi-asserted-by":"crossref","unstructured":"A. Aiken, E. Wimmers, Solving systems of set constraints, Proc. IEEE Symp. on Logic in Computer Science, Santa Cruz, CA, June 1992, pp. 329\u2013340.","DOI":"10.1109\/LICS.1992.185545"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB3","doi-asserted-by":"crossref","unstructured":"A. Aiken, E. Wimmers, Type inclusion constraints and type inference, Proc. ACM Symp. on Functional Programming and Computer Architecture, Copenhagen, Denmark, June 1993, pp. 31\u201341.","DOI":"10.1145\/165180.165188"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB4","doi-asserted-by":"crossref","unstructured":"F. Bourdoncle, S. Merz, Type checking higher-order polymorphic multi-methods, Proc. ACM Symp. on Principles of Programming Languages, Paris, France, 1997.","DOI":"10.1145\/263699.263743"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB5","series-title":"Object type constructors, submitted for publication, A preliminary version appeared in the Workshop on Foundations of Object-Oriented Languages","author":"Duggan","year":"1996"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00141-2","article-title":"Unification with extended patterns","volume":"206","author":"Duggan","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6423(00)00013-7_BIB7","doi-asserted-by":"crossref","unstructured":"J. Eifrig, S. Smith, V. Trifonov, Type inference for recursively constrained types and its application to oop, Proc. Conf. on Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science, Springer, Berlin, 1995, to appear.","DOI":"10.1016\/S1571-0661(04)80008-2"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB8","doi-asserted-by":"crossref","unstructured":"C. Flanagan, M. Felleisen, Componential set-based analysis, Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, Las Vegas, NV, 1997.","DOI":"10.1145\/258915.258937"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(90)90144-7","article-title":"Type inference with subtypes","volume":"73","author":"Fuh","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6423(00)00013-7_BIB10","doi-asserted-by":"crossref","unstructured":"F. Henglein, J. Rehof, Constraint automata and the complexity of recursive subtype entailment, in: ICALP: Ann. Internat. Colloq. on Automata, Languages and Programming, Aalborg, Denmark, 1998.","DOI":"10.1007\/BFb0055089"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB11","doi-asserted-by":"crossref","unstructured":"F. Henglein, J. Rehof, The complexity of subtype entailment for simple types, Proc. 12 Ann. IEEE Symp. on Logic in Computer Science, IEEE Computer Soc. Press, Silver Spring, MD, Warsaw, Poland, 29 June\u20132 July 1997, pp. 352\u2013361.","DOI":"10.1109\/LICS.1997.614961"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB12","doi-asserted-by":"crossref","unstructured":"M. Jones, First-class polymorphism with type inference, Proc. ACM Symp. on Principles of Programming Languages, January 1997, ACM Press, New York.","DOI":"10.1145\/263699.263765"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB13","doi-asserted-by":"crossref","unstructured":"S. Kaes, Type inference in the presence of overloading, subtyping and recursive types, Proc. ACM Symp. on Lisp and Functional Programming, 1992, ACM Press, New York, pp. 193\u2013204.","DOI":"10.1145\/141471.141540"},{"issue":"4","key":"10.1016\/S0167-6423(00)00013-7_BIB14","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1017\/S0956796800000848","volume":"3","author":"Leroy","year":"1993","journal-title":"Dynamics in ML, J. Functional Programming"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB15","doi-asserted-by":"crossref","unstructured":"P. Lincoln, J.C. Mitchell, Algorithmic aspects of type inference with subtypes, Proc. ACM Symp. on Principles of Programming Languages, 1992, ACM Press, New York, pp. 293\u2013304.","DOI":"10.1145\/143165.143227"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0747-7171(92)90011-R","article-title":"Unification under a mixed prefix","volume":"14","author":"Miller","year":"1992","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0167-6423(00)00013-7_BIB17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0167-6423(00)00013-7_BIB18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1017\/S0956796800000113","article-title":"Type inference with simple subtypes","volume":"1","author":"Mitchell","year":"1991","journal-title":"J. Funct. Programming"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB19","doi-asserted-by":"crossref","unstructured":"M. Odersky, K. L\u00e4ufer, Putting type annotations to work, Proc. ACM Symp. on Principles of Programming Languages, St. Petersburg, FL, 1996.","DOI":"10.1145\/237721.237729"},{"issue":"2","key":"10.1016\/S0167-6423(00)00013-7_BIB20","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1006\/inco.1995.1168","article-title":"Efficient inference of object types","volume":"123","author":"Palsberg","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0167-6423(00)00013-7_BIB21","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01212524","article-title":"Type inference with non-structural subtyping","volume":"9","author":"Palsberg","year":"1997","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0167-6423(00)00013-7_BIB22","series-title":"Local type inference, Proc. ACM Symp. on Principles of Programming Languages, San Diego, CA","author":"Pierce","year":"1998"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB23","series-title":"Simplifying subtyping constraints, Proc. ACM Internat. Conf. on Functional Programming, Philadelphia, PA","author":"Pottier","year":"1996"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB24","series-title":"Internat. Symp. on Theoretical Aspects of Computer Software, Sendai, Japan","first-page":"321","article-title":"Programming objects with ML-ART: an extension to ml with abstract and record types","author":"R\u00e9my","year":"1994"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB25","doi-asserted-by":"crossref","unstructured":"G. S\u00e9nizergues, The equivalence problem for deterministic pushdown automata is decidable, Proc. Internat. Conf. on Automata, Languages and Programming, Lecture Notes in Computer Science, Springer, Berlin, 1997 pp. 671\u2013681.","DOI":"10.1007\/3-540-63165-8_221"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB26","unstructured":"D. Sequeira, Type inference with bounded quantification. Ph.D. Thesis, University of Edinburgh, 1998."},{"issue":"2\/3","key":"10.1016\/S0167-6423(00)00013-7_BIB27","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-6423(94)00020-4","article-title":"Principal type schemes for functional programs with overloading and subtyping","volume":"23","author":"Smith","year":"1994","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB28","doi-asserted-by":"crossref","unstructured":"M. Solomon, Type definitions with parameters, Proc. ACM Symp. on Principles of Programming Languages, ACM Press, New York, 1978, pp. 31\u201338.","DOI":"10.1145\/512760.512765"},{"key":"10.1016\/S0167-6423(00)00013-7_BIB29","unstructured":"V. Trifonov, S. Smith, Subtyping constrained types, Static Analysis Symp. Lecture Notes in Computer Science, Vol. 1145, Springer, Berlin, 1996, pp. 349\u2013365."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642300000137?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642300000137?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T14:25:07Z","timestamp":1555770307000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642300000137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0167642300000137"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(00)00013-7","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}