{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:49:21Z","timestamp":1725533361060},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024436"},{"type":"electronic","value":"9783642024443"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02444-3_1","type":"book-chapter","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T09:15:35Z","timestamp":1244279735000},"page":"1-18","source":"Crossref","is-referenced-by-count":6,"title":["Type Inference by Coinductive Logic Programming"],"prefix":"10.1007","author":[{"given":"Davide","family":"Ancona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Lagorio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Zucca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-49538-X_2","volume-title":"ECOOP \u201995 - Object-Oriented Programming","author":"O. Agesen","year":"1995","unstructured":"Agesen, O.: The cartesian product algorithm. In: Olthoff, W. (ed.) ECOOP 1995. LNCS, vol.\u00a0952, pp. 2\u201326. Springer, Heidelberg (1995)"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/155183.155231","volume":"15","author":"R. Amadio","year":"1993","unstructured":"Amadio, R., Cardelli, L.: Subtyping recursive types. ACM Transactions on Programming Languages and Systems\u00a015(4), 575\u2013631 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR3","first-page":"53","volume-title":"OOPSLA 2007 Proceedings and Companion, DLS 2007: Proceedings of the 2007 Symposium on Dynamic Languages","author":"D. Ancona","year":"2007","unstructured":"Ancona, D., Ancona, M., Cuni, A., Matsakis, N.: RPython: a Step Towards Reconciling Dynamically and Statically Typed OO Languages. In: OOPSLA 2007 Proceedings and Companion, DLS 2007: Proceedings of the 2007 Symposium on Dynamic Languages, pp. 53\u201364. ACM, New York (2007)"},{"doi-asserted-by":"crossref","unstructured":"Ancona, D., Lagorio, G.: Type systems for object-oriented languages based on coinductive logic. Technical report, DISI - Univ. of Genova (2008) (submitted for publication)","key":"1_CR4","DOI":"10.1007\/978-3-642-03013-0_2"},{"key":"1_CR5","volume-title":"ACM Symp. on Principles of Programming Languages 2005","author":"D. Ancona","year":"2005","unstructured":"Ancona, D., Damiani, F., Drossopoulou, S., Zucca, E.: Polymorphic bytecode: Compositional compilation for Java-like languages. In: ACM Symp. on Principles of Programming Languages 2005, January 2005. ACM Press, New York (2005)"},{"key":"1_CR6","first-page":"189","volume-title":"PPDP 2002 - Principles and Practice of Declarative Programming","author":"D. Ancona","year":"2002","unstructured":"Ancona, D., Lagorio, G., Zucca, E.: True separate compilation of Java classes. In: PPDP 2002 - Principles and Practice of Declarative Programming, pp. 189\u2013200. ACM Press, New York (2002)"},{"key":"1_CR7","volume-title":"ICTCS 2007 - 10th Italian Conf. on Theoretical Computer Science 2003, eProceedings","author":"D. Ancona","year":"2007","unstructured":"Ancona, D., Lagorio, G., Zucca, E.: Type inference for polymorphic methods in Java-like languages. In: Italiano, G.F., Moggi, E., Laura, L. (eds.) ICTCS 2007 - 10th Italian Conf. on Theoretical Computer Science 2003, eProceedings. World Scientific, Singapore (2007)"},{"doi-asserted-by":"crossref","unstructured":"Ancona, D., Lagorio, G., Zucca, E.: Type inference for Java-like programs by coinductive logic programming. Technical report, Dipartimento di Informatica e Scienze dell\u2019Informazione, Universit\u00e0 di Genova (2008)","key":"1_CR8","DOI":"10.1007\/978-3-642-02444-3_1"},{"key":"1_CR9","first-page":"306","volume-title":"ACM Symp. on Principles of Programming Languages 2004","author":"D. Ancona","year":"2004","unstructured":"Ancona, D., Zucca, E.: Principal typings for Java-like languages. In: ACM Symp. on Principles of Programming Languages 2004, pp. 306\u2013317. ACM Press, New York (2004)"},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1006\/inco.1995.1086","volume":"119","author":"F. Barbanera","year":"1995","unstructured":"Barbanera, F., Dezani-Cincaglini, M., de\u2019Liguoro, U.: Intersection and union types: Syntax and semantics. Information and Computation\u00a0119(2), 202\u2013230 (1995)","journal-title":"Information and Computation"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-62688-3_29","volume-title":"Typed Lambda Calculi and Applications","author":"M. Brandt","year":"1997","unstructured":"Brandt, M., Henglein, F.: Coinductive axiomatization of recursive type equality and subtyping. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol.\u00a01210, pp. 63\u201381. Springer, Heidelberg (1997)"},{"issue":"4","key":"1_CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.3233\/FI-1998-33401","volume":"33","author":"M. Brandt","year":"1998","unstructured":"Brandt, M., Henglein, F.: Coinductive axiomatization of recursive type equality and subtyping. Fundam. Inform.\u00a033(4), 309\u2013338 (1998)","journal-title":"Fundam. Inform."},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science\u00a025, 95\u2013169 (1983)","journal-title":"Theoretical Computer Science"},{"key":"1_CR14","volume-title":"SAC 2009: Proceedings of the 2009 ACM symposium on Applied computing","author":"M. Furr","year":"2009","unstructured":"Furr, M., An, J., Foster, J.S., Hicks, M.: Static type inference for Ruby. In: SAC 2009: Proceedings of the 2009 ACM symposium on Applied computing. ACM Press, New York (to appear, 2009)"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.5381\/jot.2007.6.2.a3","volume":"6","author":"A. Igarashi","year":"2007","unstructured":"Igarashi, A., Nagira, H.: Union types for object-oriented programming. Journ. of Object Technology\u00a06(2), 47\u201368 (2007)","journal-title":"Journ. of Object Technology"},{"issue":"3","key":"1_CR16","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 Transactions on Programming Languages and Systems\u00a023(3), 396\u2013450 (2001)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.5381\/jot.2007.6.2.a4","volume":"6","author":"G. Lagorio","year":"2007","unstructured":"Lagorio, G., Zucca, E.: Just: safe unknown types in java-like languages. Journ. of Object Technology\u00a06(2), 69\u201398 (2007); special issue: OOPS track at SAC 2006","journal-title":"Journ. of Object Technology"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-540-73420-8_42","volume-title":"Automata, Languages and Programming","author":"L. Simon","year":"2007","unstructured":"Simon, L., Bansal, A., Mallya, A., Gupta, G.: Co-logic programming: Extending logic programming with coinduction. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 472\u2013483. Springer, Heidelberg (2007)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11799573_25","volume-title":"Logic Programming","author":"L. Simon","year":"2006","unstructured":"Simon, L., Mallya, A., Bansal, A., Gupta, G.: Coinductive logic programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 330\u2013345. Springer, Heidelberg (2006)"},{"unstructured":"Wang, T., Smith, S.: Polymorphic constraint-based type inference for objects. Technical report, The Johns Hopkins University (2008) (submitted for publication)","key":"1_CR20"}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02444-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T09:17:04Z","timestamp":1589879824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02444-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024436","9783642024443"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02444-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}