{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:30Z","timestamp":1725663570711},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543961"},{"type":"electronic","value":"9783540475996"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540543961_1","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:43:37Z","timestamp":1330209817000},"page":"1-14","source":"Crossref","is-referenced-by-count":18,"title":["Type classes and overloading resolution via order-sorted unification"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Nipkow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregor","family":"Snelting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"D. Cl\u00e9ment, J. Despeyroux, T. Despeyroux, and G. Kahn. A simple applicative language: Mini-ML. In Proc. ACM Conf. Lisp and Functional Programming, pages 13\u201327, 1986.","DOI":"10.1145\/319838.319847"},{"key":"1_CR2","unstructured":"M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Principal type schemes and \u03bb-calculus semantics. In R. Hindley and J. Seldin, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalisms. Academic Press, 1980."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"L. Damas and R. Milner. Principal type schemes for functional programs. In Proc. 9th ACM Symp. Principles of Programming Languages, pages 207\u2013212, 1982.","DOI":"10.1145\/582153.582176"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. 12th ACM Symp. Principles of Programming Languages, pages 52\u201366, 1985.","DOI":"10.1145\/318593.318610"},{"key":"1_CR5","first-page":"30","volume":"456","author":"F. Grosch","year":"1990","unstructured":"F. Grosch and G. Snelting. Inference-based overloading resolution for ADA. In Proc. 2nd Conf. Programming Language Implementation and Logic Programming, pages 30\u201344. LNCS 456, 1990.","journal-title":"LNCS"},{"key":"1_CR6","unstructured":"P. Hudak and P. Wadler. Report on the programming language Haskell. Version 1.0, April 1990."},{"key":"1_CR7","first-page":"131","volume":"300","author":"S. Kaes","year":"1988","unstructured":"S. Kaes. Parametric overloading in polymorphic programming languages. In Proc. 2nd European Symposium on Programming, pages 131\u2013144. LNCS 300, 1988.","journal-title":"LNCS"},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0747-7171(89)80036-7","volume":"8","author":"J. Meseguer","year":"1989","unstructured":"J. Meseguer, J. Goguen, and G. Smolka. Order-sorted unification. J. Symbolic Computation, 8:383\u2013413, 1989.","journal-title":"J. Symbolic Computation"},{"key":"1_CR9","unstructured":"R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, 1990."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"T. Nipkow. Higher-order unification, polymorphism, and subsorts. In Proc. 2nd Int. Workshop Conditional and Typed Rewriting Systems. LNCS ???, 1990.","DOI":"10.1007\/3-540-54317-1_112"},{"key":"1_CR11","unstructured":"M. Schmidt-Schau\u00df. A many-sorted calculus with polymorphic functions based on resolution and paramodulation. In Proc. 9th Int. Joint Conf. Artificial Intelligence, pages 1162\u20131168, 1985."},{"key":"1_CR12","first-page":"297","volume":"2","author":"G. Smolka","year":"1989","unstructured":"G. Smolka, W. Nutt, J. Goguen, and J. Meseguer. Order-sorted equational computation. In H. A\u00eft-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, Volume 2, pages 297\u2013367. Academic Press, 1989.","journal-title":"Resolution of Equations in Algebraic Structures"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"G. Snelting. The calculus of context relations. Acta Informatica, 1991. To appear.","DOI":"10.1007\/BF01178581"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad hoc. In Proc. 16th ACM Symp. Principles of Programming Languages, pages 60\u201376, 1989.","DOI":"10.1145\/75277.75283"},{"key":"1_CR15","unstructured":"U. Waldmann. Unification in order-sorted signatures. Technical Report 298, Fachbereich Informatik, Universit\u00e4t Dortmund, 1989."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"M. Wand. Type inference for record concatenation and multiple inheritance. In Proc. 4th IEEE Symp. Logic in Computer Science, pages 92\u201397, 1989.","DOI":"10.1109\/LICS.1989.39162"}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540543961_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:52Z","timestamp":1605646432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540543961_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543961","9783540475996"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3540543961_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}