乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:29:14Z","timestamp":1725636554982},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell'Istruzione, dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1145\/2489804.2489807","type":"proceedings-article","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T14:33:48Z","timestamp":1372775628000},"page":"1-7","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Safe corecursion in coFJ"],"prefix":"10.1145","author":[{"given":"Davide","family":"Ancona","sequence":"first","affiliation":[{"name":"DIBRIS - Universit\u00e0 di Genova, Genova, Italy"}]},{"given":"Elena","family":"Zucca","sequence":"additional","affiliation":[{"name":"DIBRIS - Universit\u00e0 di Genova, Genova, Italy"}]}],"member":"320","published-online":{"date-parts":[[2013,7]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/2076674.2076679"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/978-3-642-31057-7_21"},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","volume-title":"Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification? In FoVeOOS","author":"Ancona D.","year":"2010","unstructured":"D. Ancona , A. Corradi , G. Lagorio , and F. Damiani . Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification? In FoVeOOS 2010 , Revised Selected Papers , volume 6528 of LNCS , 2011. D. Ancona, A. Corradi, G. Lagorio, and F. Damiani. Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification? In FoVeOOS 2010, Revised Selected Papers, volume 6528 of LNCS, 2011."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1007\/978-3-642-03013-0_2"},{"key":"e_1_3_2_1_5_1","volume-title":"Idealized coinductive type systems for imperative object-oriented programs. RAIRO - Theoretical Informatics and Applications, 45(1):3--33","author":"Ancona D.","year":"2011","unstructured":"D. Ancona and G. Lagorio . Idealized coinductive type systems for imperative object-oriented programs. RAIRO - Theoretical Informatics and Applications, 45(1):3--33 , 2011 . D. Ancona and G. Lagorio. Idealized coinductive type systems for imperative object-oriented programs. RAIRO - Theoretical Informatics and Applications, 45(1):3--33, 2011."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/2318202.2318205"},{"key":"e_1_3_2_1_7_1","volume-title":"Co-LP 2012 - A workshop on Coinductive Logic Programming","author":"Ancona D.","year":"2012","unstructured":"D. Ancona and E. Zucca . Translating corecursive Featherweight Java in coinductive logic programming . In Co-LP 2012 - A workshop on Coinductive Logic Programming , 2012 . D. Ancona and E. Zucca. Translating corecursive Featherweight Java in coinductive logic programming. In Co-LP 2012 - A workshop on Coinductive Logic Programming, 2012."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science","author":"Bertot Y.","year":"2004","unstructured":"Y. Bertot and P. Cast\u00e9ran . Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science . Springer Verlag , 2004 . Y. Bertot and P. Cast\u00e9ran. Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer Verlag, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/1297027.1297052"},{"key":"e_1_3_2_1_10_1","first-page":"173","volume-title":"TFP","author":"Ghani N.","year":"2006","unstructured":"N. Ghani , M. Hamana , T. Uustalu , and V. Vene . Representing cyclic structures as nested datatypes . In TFP , pages 173 -- 188 , 2006 . N. Ghani, M. Hamana, T. Uustalu, and V. Vene. Representing cyclic structures as nested datatypes. In TFP, pages 173--188, 2006."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1238844.1238856"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/158511.158618"},{"key":"e_1_3_2_1_13_1","volume-title":"FLAIRS Conference","author":"Min R.","year":"2009","unstructured":"R. Min and G. Gupta . Coinductive logic programming and its application to boolean sat . In FLAIRS Conference , 2009 . R. Min and G. Gupta. Coinductive logic programming and its application to boolean sat. In FLAIRS Conference, 2009."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/1480881.1480890"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1007\/978-3-642-13089-2_45"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.5555\/2394539.2394596"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/11799573_25"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/2048066.2048142"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/773184.773200"}],"event":{"sponsor":["CNRS Centre National De La Rechercue Scientifique","UM2 University Montpellier 2","AITO Association Internationale pour les Technologies Objets","SIGPLAN ACM Special Interest Group on Programming Languages","SIGSOFT ACM Special Interest Group on Software Engineering"],"acronym":"ECOOP '13","name":"ECOOP '13: European Conference on Object-Oriented Programming","location":"Montpellier France"},"container-title":["Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2489804.2489807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T02:05:55Z","timestamp":1673661955000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2489804.2489807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":19,"alternative-id":["10.1145\/2489804.2489807","10.1145\/2489804"],"URL":"https:\/\/doi.org\/10.1145\/2489804.2489807","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]},"assertion":[{"value":"2013-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}