{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299365},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552512"},{"type":"electronic","value":"9783540467991"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55251-0_17","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T04:56:14Z","timestamp":1330232174000},"page":"300-321","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Partial type assignment in left linear applicative term rewriting systems"],"prefix":"10.1007","author":[{"given":"Steffen","family":"van Bakel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sjaak","family":"Smetsers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Brock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"17_CR1","volume-title":"The lambda calculus: its syntax and semantics","author":"H. Barendregt","year":"1984","unstructured":"H. Barendregt. The lambda calculus: its syntax and semantics. North-Holland, Amsterdam, revised edition, 1984.","edition":"revised edition"},{"issue":"4","key":"17_CR2","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. The Journal of Symbolic Logic, 48(4):931\u2013940, 1983.","journal-title":"The Journal of Symbolic Logic"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume-title":"Proceedings of PARLE, Parallel Architectures and Languages Europe","author":"H. P. Barendregt","year":"1987","unstructured":"H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep. Term graph rewriting. In Proceedings of PARLE, Parallel Architectures and Languages Europe, Eindhoven, The Netherlands, volume 259-II of Lecture Notes in Computer Science, pages 141\u2013158. Springer-Verlag, 1987."},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-18317-5_20","volume-title":"Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture","author":"T. Brus","year":"1987","unstructured":"T. Brus, M.C.J.D. van Eekelen, M.O. van Leer, and M.J. Plasmeijer. Clean \u2014 A Language for Functional Graph Rewriting. In Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, USA, volume 274 of Lecture Notes in Computer Science, pages 364\u2013368. Springer-Verlag, 1987."},{"key":"17_CR5","volume-title":"Combinatory Logic, volume 1","author":"H. B. Curry","year":"1958","unstructured":"H.B. Curry and R. Feys. Combinatory Logic, volume 1. North-Holland, Amsterdam, 1958."},{"key":"17_CR6","series-title":"Thesis CST-33-85","volume-title":"PhD thesis","author":"L. M. M. M. Damas","year":"1985","unstructured":"L.M.M. Damas. Type Assignment in Programming Languages. PhD thesis, University of Edinburgh, Department of Computer Science, Edinburgh, 1985. Thesis CST-33-85."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J. Goguen, J.P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proceedings 12th\nACM Symposium on Principles of Programming Languages, pages 52\u201366, 1985.","DOI":"10.1145\/318593.318610"},{"key":"17_CR8","first-page":"29","volume":"146","author":"J. R. Hindley","year":"1969","unstructured":"J.R. Hindley. The principal type scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29\u201360, 1969.","journal-title":"Transactions of the American Mathematical Society"},{"key":"17_CR9","volume-title":"Report CS-R9073","author":"J. W. Klop","year":"1990","unstructured":"J.W. Klop. Term Rewriting Systems. Report CS-R9073, Centre for Mathematics and Computer Science, Amsterdam, 1990."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"A.J. Kfoury, J. Tiuryn, and P. Urzyczyn. A proper extension of ML with an effective type-assignment. In Proceedings of the Fifteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 58\u201369, San Diego, California, 1988.","DOI":"10.1145\/73560.73565"},{"key":"17_CR11","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 Sciences, 17:348\u2013375, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR12","series-title":"Lecture Notes Computer Science","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-12925-1_41","volume-title":"Proceedings of the International Symposium on Programming","author":"A. Mycroft","year":"1984","unstructured":"A. Mycroft. Polymorphic type schemes and recursive definitions. In Proceedings of the International Symposium on Programming, Toulouse, volume 167 of Lecture Notes Computer Science, pages 217\u2013239. Springer-Verlag, 1984."},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/3-540-54152-7_66","volume-title":"Proceedings of PARLE '91, Parallel Architectures and Languages Europe","author":"E. G. J. J. M. H. M. H. H. N\u00f6cker","year":"1991","unstructured":"E.G.J.M.H. N\u00f6cker, J.E.W. Smetsers, M.C.J.D. van Eekelen, and M.J. Plasmeijer. Concurrent Clean. In Proceedings of PARLE '91, Parallel Architectures and Languages Europe, Eindhoven, The Netherlands, volume 506-II of Lecture Notes in Computer Science, pages 202\u2013219. Springer-Verlag, 1991."},{"key":"17_CR14","unstructured":"F. Pfenning. Partial Polymorphic Type Inference and Higher-Order Unification. In Proceedings of the conference on Functional Programming Languages and Computer Architecture, volume 201 of Lecture Notes in Computer Science, pages 1\u201316. Springer-Verlag, 1985."},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"J.A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23\u201341, 1965.","journal-title":"Journal of the ACM"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"D.A. Turner. Miranda: A non-strict functional language with polymorphic types. In Proceedings of the conference on Functional Programming Languages and Computer Architecture, volume 201 of Lecture Notes in Computer Science, pages 1\u201316. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-15975-4_26"}],"container-title":["Lecture Notes in Computer Science","CAAP '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55251-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:52:45Z","timestamp":1578509565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55251-0_17"}},"subtitle":["Theory, applications and implementation"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552512","9783540467991"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-55251-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}