{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T10:40:15Z","timestamp":1736592015466,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540659228"},{"type":"electronic","value":"9783540488552"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/10703163_19","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T18:15:50Z","timestamp":1160417750000},"page":"283-297","source":"Crossref","is-referenced-by-count":0,"title":["Subtyping Functional+Nonempty Record Types"],"prefix":"10.1007","author":[{"given":"Sergei","family":"Vorobyov","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Aiken, A., Wimmers, E., Lakshman, T.: Soft typing with conditional types. In: 21st ACM Symp. on Principles of Programming Languages (POPL 1994), pp. 163\u2013173 (1994)","DOI":"10.1145\/174675.177847"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/3-540-57182-5_19","volume-title":"Mathematical Foundations of Computer Science 1993","author":"M. Benke","year":"1993","unstructured":"Benke, M.: Efficient type reconstruction in presence of inheritance. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 272\u2013280. Springer, Heidelberg (1993)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-62688-3_29","volume-title":"Typed Lambda Calculi and Applications","author":"M. Brandt","year":"1997","unstructured":"Brandt, M., Henglein, F.: Coinductive axiomatization of recursive type equality and subtyping. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol.\u00a01210, pp. 63\u201381. Springer, Heidelberg (1997)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0743-1066(84)90022-0","volume":"1","author":"C. Dwork","year":"1984","unstructured":"Dwork, C., Kanellakis, P., Mitchell, J.: On the sequential nature of unification. J. Logic Programming\u00a01, 35\u201350 (1984)","journal-title":"J. Logic Programming"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BFb0032747","volume-title":"Static Analysis","author":"A. Frey","year":"1997","unstructured":"Frey, A.: Satisfying subtype inequalities in polynomial space. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol.\u00a01302, pp. 265\u2013277. Springer, Heidelberg (1997)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Hoang, M., Mitchell, J.C.: Lower bounds on type inference with subtypes. In: 22nd ACM Symp. on Principles of Programming Languages (POPL 1995), pp. 176\u2013185 (1995)","DOI":"10.1145\/199448.199481"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/S0022-0000(05)80051-0","volume":"49","author":"D. Kozen","year":"1994","unstructured":"Kozen, D., Palsberg, J., Schwartzbach, M.I.: Efficient inference of partial types. J. Comput. Syst. Sci.\u00a049, 306\u2013324 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Lincoln, P., Mitchell, J.C.: Algorithmic aspects of type inference with subtypes. In: 19th ACM Symp. on Principles of Programming Languages (POPL 1992), pp. 293\u2013304 (1992)","DOI":"10.1145\/143165.143227"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/3-540-55253-7_24","volume-title":"ESOP \u201992","author":"P.M. O\u2019Keefe","year":"1992","unstructured":"O\u2019Keefe, P.M., Wand, M.: Type inference for partial types is decidable. In: Krieg-Br\u00fcckner, B. (ed.) ESOP 1992. LNCS, vol.\u00a0582, pp. 408\u2013417. Springer, Heidelberg (1992)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1006\/inco.1995.1168","volume":"123","author":"J. Palsberg","year":"1995","unstructured":"Palsberg, J.: Efficient inference of object types. Information and Computation\u00a0123, 198\u2013209 (1995). Preliminary version in LICS 1994","journal-title":"Information and Computation"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/210184.210187","volume":"17","author":"J. Palsberg","year":"1995","unstructured":"Palsberg, J., O\u2019Keefe, P.: A type system equivalent to flow analysis. ACM Trans. Progr. Lang. Sys.\u00a017, 576\u2013599 (1995). Preliminary version in POPL 1995","journal-title":"ACM Trans. Progr. Lang. Sys."},{"issue":"5","key":"19_CR12","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/232706.232715","volume":"18","author":"J. Palsberg","year":"1996","unstructured":"Palsberg, J., Smith, J.: Constrained types and their expressiveness. ACM Trans. Progr. Lang. Sys.\u00a018(5), 519\u2013527 (1996)","journal-title":"ACM Trans. Progr. Lang. Sys."},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.3233\/FI-1996-281211","volume":"28","author":"V. Pratt","year":"1996","unstructured":"Pratt, V., Tiuryn, J.: Satisfiability of inequalities in a poset. Fundamenta Informatic\u00e6\u00a028, 165\u2013182 (1996)","journal-title":"Fundamenta Informatic\u00e6"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/3-540-19488-6_146","volume-title":"Automata, Languages and Programming","author":"S. Thatte","year":"1988","unstructured":"Thatte, S.: Type inference with partial types. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol.\u00a0317, pp. 615\u2013629. Springer, Heidelberg (1988)"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Tiuryn, J.: Subtype inequalities. In: 7th Annual IEEE Symp. on Logic in Computer Science (LICS 1992), pp. 308\u2013315 (1992)","DOI":"10.1109\/LICS.1992.185543"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-63385-5_34","volume-title":"Computational Logic and Proof Theory","author":"J. Tiuryn","year":"1997","unstructured":"Tiuryn, J.: Subtyping over a lattice (abstract). In: Gottlob, G., Leitsch, A., Mundici, D. (eds.) KGC 1997. LNCS, vol.\u00a01289, pp. 84\u201388. Springer, Heidelberg (1997)"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/3-540-61739-6_52","volume-title":"Static Analysis","author":"V. Trifonov","year":"1996","unstructured":"Trifonov, V., Smith, S.: Subtyping constrained types. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol.\u00a01145, pp. 349\u2013365. Springer, Heidelberg (1996)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Wand, M., O\u2019Keefe, P.: On the complexity of type inference with coercion. In: Functional Programming Languages and Computer Architecture 1989, pp. 293\u2013298 (1989)","DOI":"10.1145\/99370.99394"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10703163_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T09:38:21Z","timestamp":1736588301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10703163_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540659228","9783540488552"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/10703163_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}