{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T11:40:14Z","timestamp":1737632414381,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653882"},{"type":"electronic","value":"9783540493662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49366-2_14","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T18:48:47Z","timestamp":1194979727000},"page":"169-187","source":"Crossref","is-referenced-by-count":0,"title":["Type Inference for First-Class Messages with Feature Constraints"],"prefix":"10.1007","author":[{"given":"Martin","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susumu","family":"Nishimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1998,11,30]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/165180.165188","volume-title":"Proceedings of the 6th ACM Conference on Functional Programming and Computer Architecture","author":"A. Aiken","year":"1993","unstructured":"A. Aiken and E. Wimmers. Type inclusion constraints and type inference. iIn Proceedings of the 6 th ACM Conference on Functional Programming and Computer Architecture, pp. 31\u201341. ACM Press, New York, June 1993."},{"issue":"3-4","key":"14_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0743-1066(93)90043-G","volume":"16","author":"H. A\u00eft-Kaci","year":"1993","unstructured":"H. A\u00eft-Kaci and A. Podelski. Towards a meaning of life. The Journal of Logic Programming, 16(3-4):195\u2013234, July, Aug. 1993.","journal-title":"The Journal of Logic Programming"},{"issue":"1-2","key":"14_CR3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(94)90209-7","volume":"122","author":"H. A\u00eft-Kaci","year":"1994","unstructured":"H. A\u00eft-Kaci, A. Podelski, and G. Smolka. A feature-based constraint system for logic programming with entailment. Theoretical Computer Science, 122(1-2):263\u2013283, Jan. 1994.","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0743-1066(95)00033-G","volume":"24","author":"R. Backofen","year":"1995","unstructured":"R. Backofen. A complete axiomatization of a theory with feature and arity constraints. The Journal of Logic Programming, 24(1-2):37\u201371, 1995. Special Issue onComputational Linguistics and Logic Programming.","journal-title":"The Journal of Logic Programming"},{"issue":"1-2","key":"14_CR5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(94)00188-O","volume":"146","author":"R. Backofen","year":"1995","unstructured":"R. Backofen and G. Smolka. A complete and recursive feature theory. Theoretical Computer Science, 146(1-2):243\u2013268, July 1995.","journal-title":"Theoretical Computer Science"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1145\/263699.263743","volume-title":"Proceedings of the 24th ACM Symposium on Principles of Programming Languages","author":"F. Bourdoncle","year":"1997","unstructured":"F. Bourdoncle and S. Merz. Type checking higher-order polymorphic multimethods. In Proceedings of the 24 th ACM Symposium on Principles of Programming Languages, pp. 302\u2013315. ACM Press, New York, Jan. 1997."},{"issue":"4","key":"14_CR7","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1137\/S0097539791194094","volume":"23","author":"M. Dietzfelbinger","year":"1994","unstructured":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer Auf Der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM Journal of Computing, 23(4):738\u2013761, Aug. 1994.","journal-title":"SIAM Journal of Computing"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"J. Eifrig, S. Smith, and V. Trifonow. Type inference for recursively constrained types and its application to object-oriented programming. Electronic Notes in Theoretical Computer Science, 1, 1995.","DOI":"10.1016\/S1571-0661(04)80008-2"},{"key":"14_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979."},{"key":"14_CR10","first-page":"29","volume":"146","author":"R. Hindley","year":"1969","unstructured":"R. Hindley. The principal type scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29\u201360, Dec. 1969.","journal-title":"Transactions of the American Mathematical Society"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/96709.96748","volume-title":"Proceedings of the 17th ACM Symposium on Principles of Programming Languages","author":"H. G. Mairson","year":"1990","unstructured":"H. G. Mairson. Deciding ML typebility is complete for deterministic exponential time. In Proceedings of the 17 th ACM Symposium on Principles of Programming Languages, pp. 382\u2013401. ACM Press, New York, Jan. 1990."},{"key":"14_CR12","first-page":"301","volume-title":"Handbook of Theoretical Computer Science","author":"K. Mehlhorn","year":"1990","unstructured":"K. Mehlhorn and P. Tsakalides. Data structures. In van Leeuwen [31], chapter 6, pp. 301\u2013342."},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Science, 17(3):348\u2013375, 1978.","journal-title":"Journal of Computer and System Science"},{"key":"14_CR14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The Definition of Standard ML (Revised)","author":"R. Milner","year":"1997","unstructured":"R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, Cambridge, MA, 1997."},{"key":"14_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BFb0030609","volume-title":"Proceedings of the Theory and Practice of Software Development","author":"M. M\u00fcller","year":"1997","unstructured":"M. M\u00fcller, J. Niehren, and A. Podelski. Inclusion constraints over non-empty sets of trees. In M. Bidoit and M. Dauchet, eds., Proceedings of the Theory and Practice of Software Development, vol. 1214 of Lecture Notes in Computer Science, pp. 345\u2013356. Springer-Verlag, Berlin, Apr. 1997."},{"key":"14_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BFb0017447","volume-title":"Proceedings of the 3 rd International Conference on Principles and Practice of Constraint Programming","author":"M. M\u00fcller","year":"1997","unstructured":"M. M\u00fcller, J. Niehren, and A. Podelski. Ordering constraints over feature trees. In G. Smolka, ed., Proceedings of the 3 rd International Conference on Principles and Practice of Constraint Programming, vol. 1330 of Lecture Notes in Computer Science, pp. 297\u2013311. Springer-Verlag, Berlin, 1997. Full version submitted to special journal issue of CP\u201997."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"M. M\u00fcller and S. Nishimura. Type inference for first-class messages with feature constraints. Technical report, Programming Systems Lab, Universit\u00e4t des Saarlandes, 1998. http:\/\/www.ps.uni-sb.de\/Papers\/abstracts\/FirstClass98.html","DOI":"10.1007\/3-540-49366-2_14"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1145\/268946.268968","volume-title":"Proceedings of the 25th ACM Symposium on Principles of Programming Languages","author":"S. Nishimura","year":"1998","unstructured":"S. Nishimura. Static typing for dynamic messages. In Proceedings of the 25 th ACM Symposium on Principles of Programming Languages, pp. 266\u2013278. ACM Press, New York, 1998."},{"key":"14_CR19","volume-title":"Proceedings of the 7th ACM Conference on Functional Programming and Computer Architecture","author":"M. Odersky","year":"1995","unstructured":"M. Odersky, P. Wadler, and M. Wehr. A second look at overloading. In Proceedings of the 7 th ACM Conference on Functional Programming and Computer Architecture. ACM Press, New York, 1995."},{"issue":"6","key":"14_CR20","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/218570.218572","volume":"17","author":"A. Ohori","year":"1995","unstructured":"A. Ohori. A polymorphic record calculus and its compilation. ACM Transactions on Programming Languages and Systems, 17(6):844\u2013895, 1995.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"J. Palsberg. Efficient inference of object types. In Proceedings of the 9 th IEEE Symposium on Logic in Computer Science, pp. 186\u2013185. IEEE Computer Society Press, 1994.","DOI":"10.1109\/LICS.1994.316073"},{"key":"14_CR22","volume-title":"Studies in Contemporary Linguistics","author":"C. Pollard","year":"1994","unstructured":"C. Pollard and I. Sag. Head-Driven Phrase Structure Grammar. Studies in Contemporary Linguistics. Cambridge University Press, Cambridge, England, 1994."},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/75277.75284","volume-title":"Proceedings of the 16th ACM Symposium on Principles of Programming Languages","author":"D. R\u00e9my","year":"1989","unstructured":"D. R\u00e9my. Type checking records and variants in a natural extension of ML. In Proceedings of the 16 th ACM Symposium on Principles of Programming Languages, pp. 77\u201387. ACM Press, New York, 1989."},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/263699.263707","volume-title":"Proceedings of the 24th ACM Symposium on Principles of Programming Languages","author":"D. R\u00e9my","year":"1997","unstructured":"D. R\u00e9my and J. Vouillon. Objective ML: A simple object-oriented extension of ML. In Proceedings of the 24 th ACM Symposium on Principles of Programming Languages, pp. 40\u201353. ACM Press, New York, 1997."},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"W. C. Rounds. Feature logics. In J. v. Benthem and A. ter Meulen, eds., Handbook of Logic and Language, pp. 475\u2013533. Elsevier Science Publishers B.V. (North Holland), 1997. Part 2: General Topics.","DOI":"10.1016\/B978-044481714-3\/50012-6"},{"key":"14_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/BFb0015252","volume-title":"Computer Science Today","author":"G. Smolka","year":"1995","unstructured":"G. Smolka. The Oz Programming Model. In J. van Leeuwen, ed., Computer Science Today, vol. 1000 of Lecture Notes in Computer Science, pp. 324\u2013343. Springer-Verlag, Berlin, 1995."},{"issue":"3","key":"14_CR27","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0743-1066(94)90044-2","volume":"18","author":"G. Smolka","year":"1994","unstructured":"G. Smolka and R. Treinen. Records for logic programming. The Journal of Logic Programming, 18(3):229\u2013258, Apr. 1994.","journal-title":"The Journal of Logic Programming"},{"key":"14_CR28","unstructured":"M. Sulzmann. Proofs of properties about HM(X). Technical Report YALEU\/DCS\/RR-1102, Yale University, 1998."},{"key":"14_CR29","unstructured":"M. Sulzmann, M. Odersky, and M. Wehr. Type inference with constrained types (extended abstract). In B. Pierce, ed., Proceedings of the 4 th International Workshop on Foundations of Object-oriented Programming, Jan. 1997. Full version to appear in TAPOS, 1998."},{"key":"14_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1007\/3-540-57182-5_64","volume-title":"International Symposium on Mathematical Foundations of Computer Science","author":"R. Treinen","year":"1993","unstructured":"R. Treinen. Feature constraints with first-class features. In A. M. Borzyszkowski and S. Sokolowski, eds., International Symposium on Mathematical Foundations of Computer Science, vol. 711 of Lecture Notes in Computer Science, pp. 734\u2013743. Springer-Verlag, Berlin, 30 August\u20133 September 1993."},{"volume-title":"Handbook of Theoretical Computer Science","year":"1990","key":"14_CR31","unstructured":"J. van Leeuwen, ed. Handbook of Theoretical Computer Science, vol. A (Algorithms and Complexity). The MIT Press, Cambridge, MA, 1990."},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"M. Wand. Complete type inference for simple objects. In Proceedings of the IEEE Symposium on Logic in Computer Science, pp. 37\u201344. IEEE Computer Society Press, 1987. Corrigendum in LICS\u2019 88, p. 132.","DOI":"10.1109\/LICS.1988.5111"},{"key":"14_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90050-C","volume":"93","author":"M. Wand","year":"1991","unstructured":"M. Wand. Type inference for record concatenation and multiple inheritance. Information and Computation, 93:1\u201315, 1991.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Advances in Computing Science ASIAN 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49366-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T08:02:06Z","timestamp":1737532926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49366-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653882","9783540493662"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-49366-2_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}