{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:10:31Z","timestamp":1743012631550,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642294846"},{"type":"electronic","value":"9783642294853"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29485-3_13","type":"book-chapter","created":{"date-parts":[[2012,4,25]],"date-time":"2012-04-25T13:03:23Z","timestamp":1335359003000},"page":"204-218","source":"Crossref","is-referenced-by-count":1,"title":["Overloading Is NP-Complete"],"prefix":"10.1007","author":[{"given":"Jens","family":"Palsberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R.I., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison-Wesley, Reading (1986)","edition":"2"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Camarao, C., Figueiredo, L., Vasconcellos, C.: Constraint-set satisfiability for overloading. In: Proceedings of PPDP (2004)","DOI":"10.1145\/1013963.1013974"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1145\/6041.6042","volume":"17","author":"L. Cardelli","year":"1985","unstructured":"Cardelli, L., Wegner, P.: On understanding types, data abstraction, and polymorphism. ACM Computing Surveys\u00a017(4), 471\u2013522 (1985)","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1006\/inco.1995.1033","volume":"117","author":"G. Castagna","year":"1995","unstructured":"Castagna, G., Ghelli, G., Longo, G.: A calculus for overloaded functions with subtyping. Information and Computation\u00a0117(1), 115\u2013135 (1995)","journal-title":"Information and Computation"},{"key":"13_CR5","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Venneri, B.: Principal type schemes and lambda-calculus semantics. In: Seldin, J., Hindley, J. (eds.) To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 535\u2013560. Academic Press (1980)"},{"key":"13_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman (1979)"},{"key":"13_CR7","unstructured":"Gosling, J., Joy, B., Steele, G., Bracha, G.: Java Language Specification. 3rd edn. (2005), http:\/\/java.sun.com\/docs\/books\/jls\/third_edition\/html\/classes.html#8.4.9"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Higham, D.J., Higham, N.J.: MATLAB Guide. 2nd edn. SIAM (2005)","DOI":"10.1137\/1.9780898717891"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/BF01211394","volume":"4","author":"J. Roger Hindley","year":"1991","unstructured":"Roger Hindley, J.: Types with intersection: An introduction. Formal Aspects of Computing\u00a04, 470\u2013486 (1991)","journal-title":"Formal Aspects of Computing"},{"issue":"2","key":"13_CR10","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. Journal of Computer and System Sciences\u00a049(2), 306\u2013324 (1994); Preliminary version in Proceedings of FOCS 1992","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR11","unstructured":"Mathaikutty, D.A., Shukla, S.K.: Metamodeling-Driven IP Reuse for SoC Integration and Microprocessor Design. Artech House (2009)"},{"key":"13_CR12","unstructured":"MathWorks. Product documentation, matlab compiler (2011), http:\/\/www.mathworks.com\/help\/techdoc\/matlab_prog\/f2-38133.html"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","volume":"16","author":"M.S. Paterson","year":"1978","unstructured":"Paterson, M.S., Wegman, M.N.: Linear unification. Journal of Computer and System Sciences\u00a016, 158\u2013167 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC 1995), pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"13_CR15","unstructured":"Smith, G.: Polymorphic Type Inference for Languages with Overloading and Subtyping. PhD thesis, Cornell University (1991)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0167-6423(94)00020-4","volume":"23","author":"G.S. Smith","year":"1994","unstructured":"Smith, G.S.: Principal type schemes for functional programs with overloading and subtyping. Science of Computer Programming\u00a023, 197\u2013226 (1994)","journal-title":"Science of Computer Programming"},{"key":"13_CR17","unstructured":"Vachharajani, M., Vachharajani, N., Malik, S., August, D.I.: Facilitating reuse in hardware models with enhanced type inference. In: Proceedings of IEEE\/ACM\/IFIP Second International Conference on Hardware\/Software Codesign and System Synthesis (1994)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Volpano, D.: Haskell-style overloading is NP-hard. In: Proceedings of ICCL 1994, Fifth IEEE International Conference on Computer Languages, pp. 88\u201395 (May 1994)","DOI":"10.1109\/ICCL.1994.288390"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0020-0190(95)00184-0","volume":"57","author":"D. Volpano","year":"1996","unstructured":"Volpano, D.: Lower bounds on type checking overloading. Information Processing Letters\u00a057, 9\u201314 (1996)","journal-title":"Information Processing Letters"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3540543961_2","volume-title":"Functional Programming Languages and Computer Architecture","author":"D. Volpano","year":"1991","unstructured":"Volpano, D., Smith, G.: On the Complexity of ML Typability with Overloading. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol.\u00a0523, pp. 15\u201328. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","Logic and Program Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29485-3_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:11:12Z","timestamp":1743009072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29485-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642294846","9783642294853"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29485-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}