{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:54Z","timestamp":1761611214706},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672579"},{"type":"electronic","value":"9783540464327"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46432-8_6","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:22:02Z","timestamp":1184602922000},"page":"82-97","source":"Crossref","is-referenced-by-count":1,"title":["Typing Local Definitions and Conditional Expressions with Rank 2 Intersection (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Ferruccio","family":"Damiani","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,5,19]]},"reference":[{"key":"6_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3540543961_19","volume-title":"POPL\u201993","author":"S. Aditya","year":"1991","unstructured":"S. Aditya and R. Nikhil. Incremental polymorphism. In POPL\u201993, LNCS 523, pages 379\u2013405. Springer-Verlag, 1991."},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1006\/inco.1995.1141","volume":"122","author":"M. Coppo","year":"1995","unstructured":"M. Coppo and P. Giannini. Principal Types and Unification for Simple Intersection Types Systems. Information and Computation, 122(1):70\u201396, 1995.","journal-title":"Information and Computation"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"L. M. M. Damas and R. Milner. Principal type schemas for functional programs. In POPL\u201982, pages 207\u2013212. ACM, 1982.","DOI":"10.1145\/582153.582176"},{"key":"6_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/3-540-57887-0_122","volume-title":"TACS\u201994","author":"F. Damiani","year":"1994","unstructured":"F. Damiani and P. Giannini. A Decidable Intersection Type System based on Relevance. In TACS\u201994, LNCS 789, pages 707\u2013725. Springer-Verlag, 1994."},{"key":"6_CR5","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511608865","volume-title":"Basic Simple Type Theory","author":"R. Hindley","year":"1997","unstructured":"R. Hindley. Basic Simple Type Theory. Number 42 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, London, 1997."},{"key":"6_CR6","unstructured":"T. Jim. Rank 2 type systems and recursive definitions. Technical Report MIT\/LCS\/TM-531, LCS, Massachusetts Institute of Technology, 1995."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"T. Jim. What are principal typings and what are they good for? In POPL\u201996, pages 42\u201353. ACM, 1996.","DOI":"10.1145\/237721.237728"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"A. J. Kfoury and J. B. Wells. A direct algorithm for type inference in the rank-2 fragment of the second-order lambda-calculus. In LISP and Functional Programming\u2019 94. ACM, 1994.","DOI":"10.1145\/182409.182456"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"A. J. Kfoury and J. B. Wells. Principality and Decidable Type Inference for Finite-Rank Intersection Types. In POPL\u201999. ACM, 1999.","DOI":"10.1145\/292540.292556"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"D. Leivant. Polymorphic Type Inference. In POPL\u201983. ACM, 1983.","DOI":"10.1145\/567067.567077"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML-Revised. MIT press, 1997.","DOI":"10.7551\/mitpress\/2319.001.0001"},{"key":"6_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-12925-1_41","volume-title":"International Symposium on Programming","author":"A. Mycroft","year":"1984","unstructured":"A. Mycroft. Polymorphic Type Schemes and Recursive Definitions. In International Symposium on Programming, LNCS 167, pages 217\u2013228. Springer-Verlag, 1984."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Z. Shao and A. W. Appel. Smartest recompilation. In POPL\u201993, pages 439\u2013450. ACM, 1993.","DOI":"10.1145\/158511.158702"},{"key":"6_CR14","unstructured":"S. van Bakel. Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems. PhD thesis, Katholieke Universiteit Nijmegen, 1993."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1006\/inco.1995.1040","volume":"117","author":"H. Yokouchi","year":"1995","unstructured":"H. Yokouchi. Embedding a Second-Order Type System into an Intersection Type System. Information and Computation, 117:206\u2013220, 1995.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46432-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:32:30Z","timestamp":1556681550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46432-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672579","9783540464327"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46432-8_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}