{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:37:15Z","timestamp":1725745035557},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,9,19]]},"DOI":"10.1145\/2370776.2370792","type":"proceedings-article","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T23:48:43Z","timestamp":1348616923000},"page":"115-126","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Linear dependent types in a call-by-value scenario"],"prefix":"10.1145","author":[{"given":"Ugo","family":"Dal lago","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Bologna & INRIA, Bologna, Italy"}]},{"given":"Barbara","family":"Petit","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Bologna & INRIA, Bologna, Italy"}]}],"member":"320","published-online":{"date-parts":[[2012,9,19]]},"reference":[{"volume-title":"The Optimal Implementation of Functional Programming Languages","year":"1998","author":"Asperti A.","key":"e_1_3_2_1_1_1","unstructured":"A. Asperti and S. Guerrini . The Optimal Implementation of Functional Programming Languages . Cambridge University Press , 1998 . A. Asperti and S. Guerrini. The Optimal Implementation of Functional Programming Languages. Cambridge University Press, 1998."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.2869"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/280474"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.08.005"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87531-4_35"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207005"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093883253"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/325694.325716"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555746.1555749"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.22"},{"volume-title":"Linear dependent types in a call-by-value scenario (long version).","year":"2012","author":"Dal Lago U.","key":"e_1_3_2_1_12_1","unstructured":"U. Dal Lago and B. Petit . Linear dependent types in a call-by-value scenario (long version). Available at http:\/\/arxiv.org\/abs\/1207.5592, 2012 . U. Dal Lago and B. Petit. Linear dependent types in a call-by-value scenario (long version). Available at http:\/\/arxiv.org\/abs\/1207.5592, 2012."},{"volume-title":"Mathematical theory of program correctness","year":"1980","author":"de Bakker J. W.","key":"e_1_3_2_1_13_1","unstructured":"J. W. de Bakker , A. de Bruin , and J. Zucker . Mathematical theory of program correctness . Prentice-Hall international series in computer science. Prentice Hall , 1980 . J. W. de Bakker, A. de Bruin, and J. Zucker. Mathematical theory of program correctness. Prentice-Hall international series in computer science. Prentice Hall, 1980."},{"volume-title":"Execution time of lambda-terms via denotational semantics and intersection types.","year":"2009","author":"de Carvalho D.","key":"e_1_3_2_1_14_1","unstructured":"D. de Carvalho . Execution time of lambda-terms via denotational semantics and intersection types. Available at http:\/\/arxiv.org\/abs\/0905.4251, 2009 . D. de Carvalho. Execution time of lambda-terms via denotational semantics and intersection types. Available at http:\/\/arxiv.org\/abs\/0905.4251, 2009."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90386-T"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926427"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/788021.788962"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706327"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.29"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96711"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00358-2"},{"volume-title":"North-Holland","year":"1989","author":"Odifreddi P.","key":"e_1_3_2_1_23_1","unstructured":"P. Odifreddi . Classical Recursion Theory: the Theory of Functions and Sets of Natural Numbers. Number 125 in Studies in Logic and the Foundations of Mathematics . North-Holland , 1989 . P. Odifreddi. Classical Recursion Theory: the Theory of Functions and Sets of Natural Numbers. Number 125 in Studies in Logic and the Foundations of Mathematics. North-Holland, 1989."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.806121"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/353629.353648"},{"key":"e_1_3_2_1_27_1","first-page":"231","volume-title":"LICS","author":"Xi H.","year":"2001","unstructured":"H. Xi . Dependent types for program termination verification . In LICS , pages 231 -- 246 . IEEE Comp. Soc. , 2001 . H. Xi. Dependent types for program termination verification. In LICS, pages 231--246. IEEE Comp. Soc., 2001."}],"event":{"name":"PPDP'12: Principles and Practice of Declarative Programming","sponsor":["Kuleuven Belgium Kuleuven Belgium","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Leuven Belgium","acronym":"PPDP'12"},"container-title":["Proceedings of the 14th symposium on Principles and practice of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2370776.2370792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T02:41:13Z","timestamp":1673577673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2370776.2370792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,19]]},"references-count":26,"alternative-id":["10.1145\/2370776.2370792","10.1145\/2370776"],"URL":"https:\/\/doi.org\/10.1145\/2370776.2370792","relation":{},"subject":[],"published":{"date-parts":[[2012,9,19]]},"assertion":[{"value":"2012-09-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}
