{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:29Z","timestamp":1742913569708,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403545"},{"type":"electronic","value":"9783642403552"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40355-2_4","type":"book-chapter","created":{"date-parts":[[2013,8,29]],"date-time":"2013-08-29T22:59:15Z","timestamp":1377817155000},"page":"27-46","source":"Crossref","is-referenced-by-count":0,"title":["Functional Type Assignment for Featherweight Java"],"prefix":"10.1007","author":[{"given":"Steffen J.","family":"van Bakel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reuben N. S.","family":"Rowe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(92)90297-S","volume":"102","author":"S. Bakel van","year":"1992","unstructured":"van Bakel, S.: Complete restrictions of the Intersection Type Discipline. Theoretical Computer Science\u00a0102(1), 135\u2013163 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0304-3975(95)00073-6","volume":"151","author":"S. Bakel van","year":"1995","unstructured":"van Bakel, S.: Intersection Type Assignment Systems. Theoretical Computer Science\u00a0151(2), 385\u2013435 (1995)","journal-title":"Theoretical Computer Science"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1016\/j.apal.2010.04.010","volume":"161","author":"S. Bakel van","year":"2010","unstructured":"van Bakel, S.: Completeness and Partial Soundness Results for Intersection & Union Typing for \n                  \n                    \n                  \n                  $\\bar\\lambda\\mu\\bar\\mu$\n                . Annals of Pure and Applied Logic\u00a0161, 1400\u20131430 (2010)","journal-title":"Annals of Pure and Applied Logic"},{"doi-asserted-by":"crossref","unstructured":"van Bakel, S.: Strict intersection types for the Lambda Calculus. ACM Computing Surveys\u00a043, 20:1\u201320:49 (2011)","key":"4_CR4","DOI":"10.1145\/1922649.1922657"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2012-770","volume":"121","author":"S. Bakel van","year":"2012","unstructured":"van Bakel, S.: Completeness and Soundness results for \n                  \n                    \n                  \n                  $\\cal X$\n                 with Intersection and Union Types. Fundamenta Informaticae\u00a0121, 1\u201341 (2012)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/s00224-007-9079-5","volume":"42","author":"S. Bakel van","year":"2008","unstructured":"van Bakel, S., de Liguoro, U.: Logical equivalence for subtyping object and recursive types. Theory of Computing Systems\u00a042(3), 306\u2013348 (2008)","journal-title":"Theory of Computing Systems"},{"issue":"133","key":"4_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/inco.1996.2617","volume":"2","author":"S. Bakel van","year":"1997","unstructured":"van Bakel, S., Fern\u00e1ndez, M.: Normalisation Results for Typeable Rewrite Systems. Information and Computation\u00a02(133), 73\u2013116 (1997)","journal-title":"Information and Computation"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/S0304-3975(02)00548-0","volume":"290","author":"S. Bakel van","year":"2003","unstructured":"van Bakel, S., Fern\u00e1ndez, M.: Normalisation, Approximation, and Semantics for Combinator Systems. Theoretical Computer Science\u00a0290, 975\u20131019 (2003)","journal-title":"Theoretical Computer Science"},{"unstructured":"Barendregt, H.: The Lambda Calculus: its Syntax and Semantics, revised edition. North-Holland, Amsterdam (1984)","key":"4_CR9"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic\u00a048(4), 931\u2013940 (1983)","journal-title":"Journal of Symbolic Logic"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-18317-5_20","volume-title":"Functional Programming Languages and Computer Architecture","author":"T. Brus","year":"1987","unstructured":"Brus, T., van Eekelen, M.C.J.D., van Leer, M.O., Plasmeijer, M.J.: Clean - A Language for Functional Graph Rewriting. In: Kahn, G. (ed.) FPCA 1987. LNCS, vol.\u00a0274, pp. 364\u2013368. Springer, Heidelberg (1987)"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"40","DOI":"10.2307\/2269326","volume":"1","author":"A. Church","year":"1936","unstructured":"Church, A.: A Note on the Entscheidungsproblem. Journal of Symbolic Logic\u00a01(1), 40\u201341 (1936)","journal-title":"Journal of Symbolic Logic"},{"issue":"4","key":"4_CR13","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","volume":"21","author":"M. Coppo","year":"1980","unstructured":"Coppo, M., Dezani-Ciancaglini, M.: An Extension of the Basic Functionality Theory for the \u03bb-Calculus. Notre Dame Journal of Formal Logic\u00a021(4), 685\u2013693 (1980)","journal-title":"Notre Dame Journal of Formal Logic"},{"doi-asserted-by":"crossref","unstructured":"Curry, H.B.: Grundlagen der Kombinatorischen Logik. American Journal of Mathematics\u00a052, 509\u2013536, 789\u2013834 (1930)","key":"4_CR14","DOI":"10.2307\/2370716"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1145\/503502.503505","volume":"23","author":"A. Igarashi","year":"2001","unstructured":"Igarashi, A., Pierce, B.C., Wadler, P.: Featherweight Java: a minimal core calculus for Java and GJ. ACM Trans. Program. Lang. Syst.\u00a023(3), 396\u2013450 (2001)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"Milner, R.: A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences\u00a017, 348\u2013375 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-54152-7_66","volume-title":"PARLE \u201991. Parallel Architectures and Languages Europe","author":"E.G.J.M.H. N\u00f6cker","year":"1991","unstructured":"N\u00f6cker, E.G.J.M.H., Smetsers, J.E.W., van Eekelen, M.C.J.D., Plasmeijer, M.J.: Concurrent Clean. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds.) PARLE 1991. LNCS, vol.\u00a0506, pp. 202\u2013219. Springer, Heidelberg (1991)"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Logic Programming and Automated Reasoning","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: An algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624, pp. 190\u2013201. Springer, Heidelberg (1992)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-21691-6_19","volume-title":"Typed Lambda Calculi and Applications","author":"R.N.S. Rowe","year":"2011","unstructured":"Rowe, R.N.S., van Bakel, S.J.: Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming. In: Ong, L. (ed.) TLCA 2011. LNCS, vol.\u00a06690, pp. 229\u2013244. Springer, Heidelberg (2011)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/0205036","volume":"5","author":"C.P. Wadsworth","year":"1976","unstructured":"Wadsworth, C.P.: The relation between computational and denotational properties for Scott\u2019s D\u2009\u221e\u2009-models of the lambda-calculus. SIAM Journal on Computing\u00a05, 488\u2013521 (1976)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","The Beauty of Functional Code"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40355-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T22:40:28Z","timestamp":1578523228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40355-2_4"}},"subtitle":["To Rinus Plasmeijer, in Honour of His 61st Birthday"],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403545","9783642403552"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40355-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}