{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:00:16Z","timestamp":1725512416564},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540713883"},{"type":"electronic","value":"9783540713890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71389-0_3","type":"book-chapter","created":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T20:22:53Z","timestamp":1183321373000},"page":"17-31","source":"Crossref","is-referenced-by-count":2,"title":["Iterator Types"],"prefix":"10.1007","author":[{"given":"Sandra","family":"Alves","sequence":"first","affiliation":[]},{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"M\u00e1rio","family":"Florido","sequence":"additional","affiliation":[]},{"given":"Ian","family":"Mackie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","volume":"111","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S.: Computational Interpretations of Linear Logic. Theoretical Computer Science\u00a0111, 3\u201357 (1993)","journal-title":"Theoretical Computer Science"},{"key":"3_CR2","unstructured":"Alves, S.: The power of closed-reduction strategies. In: Proceedings of WRS 2006, 6th International Workshop on Rewriting Strategies, FLOC 2006, Seattle (2006)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11874683_8","volume-title":"Computer Science Logic","author":"S. Alves","year":"2006","unstructured":"Alves, S., et al.: The power of linear functions. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, Springer, Heidelberg (2006)"},{"key":"3_CR4","unstructured":"Bakel, S.: Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems. PhD thesis, Department of Computer Science, University of Nijmegen (1993)"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0304-3975(95)00073-6","volume":"151","author":"S. Bakel","year":"1995","unstructured":"Bakel, S.: Intersection type assignment systems. Theoretical Computer Science\u00a0151(2), 385\u2013435 (1995)","journal-title":"Theoretical Computer Science"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H.P. Barendregt","year":"1983","unstructured":"Barendregt, H.P., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type-assignment. J. Symbolic Logic\u00a048, 931\u2013940 (1983)","journal-title":"J. Symbolic Logic"},{"issue":"4","key":"3_CR7","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"},{"key":"3_CR8","unstructured":"Damas, L.M.M.: Type Assignment in Programming Languages. PhD thesis, University of Edinburgh (1985)"},{"key":"3_CR9","first-page":"207","volume-title":"Conference Record of the Ninth Annual ACM Symposium on the Principles of Programming Languages","author":"L.M.M. Damas","year":"1982","unstructured":"Damas, L.M.M., Milner, R.: Principal type schemes for functional programs. In: Conference Record of the Ninth Annual ACM Symposium on the Principles of Programming Languages, pp. 207\u2013212. ACM Press, New York (1982)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Damiani, F.: Rank-2 intersection and polymorphic recursion (2005)","DOI":"10.1007\/11417170_12"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1017\/S0960129504004633","volume":"15","author":"M. Fern\u00e1ndez","year":"2005","unstructured":"Fern\u00e1ndez, M., Mackie, I., Sinot, F.-R.: Closed reduction: explicit substitutions without alpha conversion. Mathematical Structures in Computer Science\u00a015(2), 343\u2013381 (2005)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear Logic. Theoretical Computer Science\u00a050(1), 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"3_CR13","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0049-237X(08)70271-4","volume-title":"Logic Colloquium 88","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y.: Geometry of interaction 1: Interpretation of System F. In: Ferro, R., et al. (eds.) Logic Colloquium 88. Studies in Logic and the Foundations of Mathematics, vol.\u00a0127, pp. 221\u2013260. North Holland, Amsterdam (1989)"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1090\/conm\/092\/1003197","volume-title":"Categories in Computer Science and Logic: Proc. of the Joint Summer Research Conference","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y.: Towards a geometry of interaction. In: Gray, J.W., Scedrov, A. (eds.) Categories in Computer Science and Logic: Proc. of the Joint Summer Research Conference, pp. 69\u2013108. American Mathematical Society, Providence (1989)"},{"issue":"1-3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.scico.2004.01.004","volume":"50","author":"C. Haack","year":"2004","unstructured":"Haack, C., Wells, J.B.: Type error slicing in implicitly typed higher-order languages. Sci. Comput. Program.\u00a050(1-3), 189\u2013224 (2004), doi:10.1016\/j.scico.2004.01.004","journal-title":"Sci. Comput. Program."},{"key":"3_CR16","unstructured":"Jim, T.: Rank 2 type systems and recursive definitions. Technical report, Massachusetts Institute of Technology (1995)"},{"key":"3_CR17","volume-title":"Proceedings of the 23rd ACM Symposium on Principles of Programming Languages (POPL\u201996)","author":"T. Jim","year":"1996","unstructured":"Jim, T.: What are principal typings and what are they good for? In: Proceedings of the 23rd ACM Symposium on Principles of Programming Languages (POPL\u201996), ACM Press, New York (1996)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/317636.317788","volume-title":"Proceedings of the 1999 International Conference on Functional Programming","author":"A.J. Kfoury","year":"1999","unstructured":"Kfoury, A.J., et al.: Relating typability and expressibility in finite-rank intersection type systems. In: Proceedings of the 1999 International Conference on Functional Programming, pp. 90\u2013101. ACM Press, New York (1999)"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/96709.96718","volume-title":"Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL\u201990)","author":"Y. Lafont","year":"1990","unstructured":"Lafont, Y.: Interaction nets. In: Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL\u201990), Jan. 1990, pp. 95\u2013108. ACM Press, New York (1990)"},{"issue":"4","key":"3_CR20","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1017\/S0956796800001131","volume":"4","author":"I. Mackie","year":"1994","unstructured":"Mackie, I.: Lilac: A functional programming language based on linear logic. Journal of Functional Programming\u00a04(4), 395\u2013433 (1994)","journal-title":"Journal of Functional Programming"},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli, A., Montanari, U.: An efficient unification algorithm. Transactions on Programming Languages and Systems\u00a04(2), 258\u2013282 (1982)","journal-title":"Transactions on Programming Languages and Systems"},{"issue":"3","key":"3_CR22","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(3), 348\u2013375 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR23","first-page":"535","volume-title":"To H.B. Curry, Essays in Combinatory Logic, Lambda-Calculus and Formalism","author":"G. Pottinger","year":"1980","unstructured":"Pottinger, G.: A type assignment for strongly normalizable \u03bb-terms. In: To H.B. Curry, Essays in Combinatory Logic, Lambda-Calculus and Formalism, pp. 535\u2013560. Academic Press, London (1980)"},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. Journal of the ACM\u00a012(1), 23\u201341 (1965)","journal-title":"Journal of the ACM"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/3-540-19242-5_17","volume-title":"Conditional Term Rewriting Systems","author":"Y. Toyama","year":"1988","unstructured":"Toyama, Y.: Confluent term rewriting systems with membership. In: Kaplan, S., Jouannaud, J.-P. (eds.) CTRS 1987. LNCS, vol.\u00a0308, pp. 228\u2013241. Springer, Heidelberg (1988)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/3-540-56393-8_29","volume-title":"Conditional Term Rewriting Systems","author":"J. Yamada","year":"1993","unstructured":"Yamada, J.: Confluence of terminating membership conditional trs. In: Rusinowitch, M., Remy, J.-L. (eds.) CTRS 1992. LNCS, vol.\u00a0656, pp. 378\u2013392. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71389-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:19:39Z","timestamp":1605763179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71389-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540713883","9783540713890"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71389-0_3","relation":{},"subject":[]}}