{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300945,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578871"},{"type":"electronic","value":"9783540483830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57887-0_122","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:38:59Z","timestamp":1330263539000},"page":"707-725","source":"Crossref","is-referenced-by-count":9,"title":["A decidable intersection type system based on relevance"],"prefix":"10.1007","author":[{"given":"Ferruccio","family":"Damiani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Giannini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"36_CR1","first-page":"931","volume":"48","author":"H. P. Barendregt","year":"1983","unstructured":"H. P. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. Notre Dame Journal of Formal Logic, 48:931\u2013940, 1983.","journal-title":"Notre Dame Journal of Formal Logic"},{"issue":"4","key":"36_CR2","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1145\/6041.6042","volume":"17","author":"L. Cardelli","year":"1985","unstructured":"L. Cardelli and P. Wegner. On Understanding Types, Data Abstraction and Polymorphism. Computing Survey, 17(4):470\u2013522, 1985.","journal-title":"Computing Survey"},{"issue":"4","key":"36_CR3","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 basic functional theory for lambda-calculus. Notre Dame Journal of Formal Logic, 21(4):685\u2013693, 1980.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"M. Coppo and A. Ferrari. Type inference, abstract interpretation and strictness analysis. To appear in Theoretical Computer Science, 1993.","DOI":"10.1016\/0304-3975(93)90086-9"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"M. Coppo and P. Giannini. A complete type inference algoritm for simple intersection types. In CAAP, LNCS581, pages 102\u2013123. Springer, 1992.","DOI":"10.1007\/3-540-55251-0_6"},{"key":"36_CR6","volume-title":"Combinatory Logic, volume I","author":"H. B. Curry","year":"1958","unstructured":"H. B. Curry and R. Feys. Combinatory Logic, volume I. North-Holland, Amsterdam, 1958."},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"L. M. M. Damas and R. Milner. Principal type schemas for functional programs. In 9th ACM Symposium on Principles of Programming Languages, pages 207\u2013212. ACM, 1982.","DOI":"10.1145\/582153.582176"},{"key":"36_CR8","unstructured":"F. Damiani. Sistemi Decidibili di Inferenza per Tipi con Intersezione Debole. Master's thesis, Universit\u00e0 di Torino, 1993."},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.2307\/2275370","volume":"57","author":"D. M. Gabbay","year":"1992","unstructured":"D. M. Gabbay and R. J.G. B. De Queiroz. Extending the Curry-Howard Interpretation to Linear, Relevant and Other Resource Logics. Journal of Simbolic Logic, 57:1319\u20131365, 1992.","journal-title":"Journal of Simbolic Logic"},{"key":"36_CR10","unstructured":"J. Y. Girard. Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur. PhD thesis, Universit\u00e9 Paris VII, 1971."},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edimburg LCF. LNCS78. Springer, 1979.","DOI":"10.1007\/3-540-09724-4"},{"key":"36_CR12","first-page":"29","volume":"146","author":"R. Hindley","year":"1969","unstructured":"R. Hindley. The principal types schemes for an object in combinatory logic. Trans. American Math. Soc., 146:29\u201360, 1969.","journal-title":"Trans. American Math. Soc."},{"key":"36_CR13","volume-title":"To H. B. Curry. Essays on Combinatory Logic, Lambda-calculus and Formalism","author":"W. A. Howard","year":"1980","unstructured":"W. A. Howard. Formulae as types. In R. Hindley and J. Seldin, editors, To H. B. Curry. Essays on Combinatory Logic, Lambda-calculus and Formalism. Accademic Press, London, 1980."},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"A. J. Kfoury and J. Tyurin. Type reconstruction in finite-rank fragments of the polymorfic \u03bb-calculus. In Logic in Computer Science, pages 2\u201311, 1990.","DOI":"10.1109\/LICS.1990.113728"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"D. Leivant. Polymorphic Type Inference. In Principles of Programming Languages. ACM, 1983.","DOI":"10.1145\/567067.567077"},{"key":"36_CR16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(86)90109-X","volume":"44","author":"D. Leivant","year":"1986","unstructured":"D. Leivant. Typings and Computational Properties of \u03bb-expressions. Theoretical Computer Science, 44:51\u201368, 1986.","journal-title":"Theoretical Computer Science"},{"key":"36_CR17","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 Polimorphism in Programming. Journal of Computer and System Science, 17:348\u2013375, 1978.","journal-title":"Journal of Computer and System Science"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"J. C. Reynolds. Towards a Theory of Type Structure. In Colloque sur la Programmation, LNCS19. Springer, 1974.","DOI":"10.1007\/3-540-06859-7_148"},{"key":"36_CR19","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0304-3975(83)90069-5","volume":"28","author":"S. R. Rocca della","year":"1984","unstructured":"S. Ronchi della Rocca and B. Venneri. Principal Types Schemes for an extended type theory. Theoretical Computer Science, 28:151\u2013169, 1984.","journal-title":"Theoretical Computer Science"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"D. A. Turner. Miranda: a non-strict functional language with polymorfic types. In Proceedings of the IFIP International Conference on Functional Programming Languages and Computer Architecture, LNCS201, pages 1\u201316. Springer, 1985.","DOI":"10.1007\/3-540-15975-4_26"},{"key":"36_CR21","unstructured":"S. van Bakel. Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems. PhD thesis, Katholieke Universiteit Nijmegen, 1993."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57887-0_122.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:16:19Z","timestamp":1742595379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57887-0_122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578871","9783540483830"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-57887-0_122","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}