{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:02:33Z","timestamp":1778292153034,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540565178","type":"print"},{"value":"9783540475866","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bfb0037096","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:21:36Z","timestamp":1138202496000},"page":"29-44","source":"Crossref","is-referenced-by-count":4,"title":["Partial intersection type assignment in applicative term rewriting systems"],"prefix":"10.1007","author":[{"given":"Steffen","family":"van Bakel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,28]]},"reference":[{"key":"3_CR1","unstructured":"S. van Bakel. Principal type schemes for the Strict Type Assignment System. Technical Report 91-6, Department of Computer Science, University of Nijmegen, 1991."},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(92)90297-S","volume":"102","author":"S. Bakel van","year":"1992","unstructured":"S. van Bakel. Complete restrictions of the Intersection Type Discipline. Theoretical Computer Science, 102:135\u2013163, 1992.","journal-title":"Theoretical Computer Science"},{"key":"3_CR3","unstructured":"S. van Bakel. Partial Intersection Type Assignment of Rank 2 in Applicative Term Rewriting Systems. Technical Report 92-03, Department of Computer Science, University of Nijmegen, 1992."},{"key":"3_CR4","first-page":"300","volume-title":"volume 581 of Lecture Notes in Computer Science","author":"S. Bakel van","year":"1992","unstructured":"S. van Bakel, S. Smetsers, and S. Brock. Partial Type Assignment in Left Linear Applicative Term Rewriting Systems. In J.-C. Raoult, editor, Proceedings of CAAP '92. 17th Colloquim on Trees in Algebra and Programming, Rennes, France, volume 581 of Lecture Notes in Computer Science, pages 300\u2013321. Springer-Verlag, 1992."},{"key":"3_CR5","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":"3_CR6","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":"3_CR7","first-page":"141","volume-title":"volume 259-II of Lecture Notes in Computer Science","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":"3_CR8","first-page":"364","volume-title":"volume 274 of Lecture Notes in Computer Science","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."},{"issue":"4","key":"3_CR9","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","volume":"21","author":"M. Coppo","year":"1980","unstructured":"M. Coppo and M. Dezani-Ciancaglini. An Extension of the Basic Functionality Theory for the \u03bb-Calculus. Notre Dame, Journal of Formal Logic, 21(4): 685\u2013693,1980.","journal-title":"Notre Dame, Journal of Formal Logic"},{"key":"3_CR10","first-page":"535","volume-title":"To H. B. Curry, Essays in combinatory logic, lambda-calculus and formalism","author":"M. Coppo","year":"1980","unstructured":"M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Principal type schemes and \u03bb-calculus semantics. In J. R. Hindley and J. P. Seldin, editors, To H. B. Curry, Essays in combinatory logic, lambda-calculus and formalism, pages 535\u2013560. Academic press, New York, 1980."},{"key":"3_CR11","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":"3_CR12","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 245\u2013320. North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(92)90306-Z","volume":"100","author":"M. Dezani-Ciancaglini","year":"1992","unstructured":"M. Dezani-Ciancaglini and J.R. Hindley. Intersection types for combinatory logic. Theoretical Computer Science, 100:303\u2013324, 1992.","journal-title":"Theoretical Computer Science"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J. Goguen, J.P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proceedings 12th ACM Symposium on Principles of Programming Languages, pages 52\u201366, 1985.","DOI":"10.1145\/318593.318610"},{"key":"3_CR15","unstructured":"J.W. Klop. Term Rewriting Systems. Report CS-R9073, Centre for Mathematics and Computer Science, Amsterdam, 1990."},{"key":"3_CR16","doi-asserted-by":"crossref","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":"3_CR17","first-page":"202","volume-title":"volume 506-II of Lecture Notes in Computer Science","author":"E.G.J.M.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":"3_CR18","doi-asserted-by":"crossref","unstructured":"S. Peyton Jones and J. Salkild. The spineless tagless G-machine. In Functional Programming Languages and Computer Architecture, pages 184\u2013201. ACM press, 1989.","DOI":"10.1145\/99370.99385"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"F. Pfenning. Partial Polymorphic Type Inference and Higher-Order Unification. In Proceedings of the 1988 conference on LISP and Functional Programming Languages, volume 201 of Lecture Notes in Computer Science, pages 153\u2013163. Springer-Verlag, 1988.","DOI":"10.1145\/62678.62697"},{"key":"3_CR20","series-title":"CMU-CS-91-205","volume-title":"PhD thesis","author":"B.C. Pierce","year":"1991","unstructured":"B.C. Pierce. Programming with Intersection Types and Bounded Polymorphism. PhD thesis, Carnegie Mellon University, School of Computer Science, Pitssburgh, 1991. CMU-CS-91-205."},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0304-3975(83)90069-5","volume":"28","author":"S. Ronchi della Rocca","year":"1984","unstructured":"S. Ronchi della Rocca and B. Venneri. Principal type schemes for an extended type theory. Theoretical Computer Science, 28:151\u2013169, 1984.","journal-title":"Theoretical Computer Science"},{"key":"3_CR22","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","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T14:37:21Z","timestamp":1555425441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565178","9783540475866"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0037096","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}