{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T20:18:28Z","timestamp":1784233108312,"version":"3.55.0"},"reference-count":10,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1997,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>\n            We present an O(n\n            <jats:sup>3<\/jats:sup>\n            ) time type inference algorithm for a type system with a largest type\n            <jats:italic>\u03a4<\/jats:italic>\n            , a smallest type \u22a5, and the usual ordering between function types. The algorithm infers type annotations of least shape, and it works equally well for recursive types. For the problem of typability, our algorithm is simpler than the one of Kozen, Palsberg, and Schwartzbach for type inference\n            <jats:italic>without<\/jats:italic>\n            \u22a5. This may be surprising, especially because the system with \u22a5 is strictly more powerful.\n          <\/jats:p>","DOI":"10.1007\/bf01212524","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T13:30:20Z","timestamp":1109338220000},"page":"49-67","source":"Crossref","is-referenced-by-count":16,"title":["Type inference with non-structural subtyping"],"prefix":"10.1145","volume":"9","author":[{"given":"Jens","family":"Palsberg","sequence":"first","affiliation":[{"name":"Department of Computer Science, Purdue University, 47907, W. Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mitchell","family":"Wand","sequence":"additional","affiliation":[{"name":"College of Computer Science, Northeastern University, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"O'Keefe","sequence":"additional","affiliation":[{"name":"151 Coolidge Avenue #211, Watertown, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/155183.155231"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80051-0"},{"key":"e_1_2_1_2_3_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500000657"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"crossref","unstructured":"Mitchell J.: Coercion and type inference. In Eleventh Symposium on Principles of Programming Languages pages 175\u2013185 1984.","DOI":"10.1145\/800017.800529"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000113"},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/210184.210187"},{"key":"e_1_2_1_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90196-3"},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"crossref","unstructured":"Thatte S.: Type inference with partial types. In Proc. International Colloquium on Automata Languages and Programming 1988 pages 615\u2013629. Springer-Verlag (LNCS 317) 1988.","DOI":"10.1007\/3-540-19488-6_146"},{"key":"e_1_2_1_2_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90050-C"},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500000815"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01212524.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01212524\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01212524","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:27:57Z","timestamp":1641482877000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01212524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["10.1007\/BF01212524"],"URL":"https:\/\/doi.org\/10.1007\/bf01212524","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}