{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:57:00Z","timestamp":1770285420026,"version":"3.49.0"},"reference-count":41,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785725","type":"proceedings-article","created":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T21:15:55Z","timestamp":1565039755000},"page":"1-13","source":"Crossref","is-referenced-by-count":17,"title":["Type-Based Complexity Analysis of Probabilistic Functional Programs"],"prefix":"10.1109","author":[{"given":"Martin","family":"Avanzini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Dal Lago","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexis","family":"Ghyselen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF01019462"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/113445.113468"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192394"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63387-9_6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41528-4_1"},{"key":"ref37","first-page":"511","article-title":"Probabilistic Program Analysis with Martingales","volume":"8044","author":"chakarov","year":"2013","journal-title":"Proc of 25th CAV ser LNCS"},{"key":"ref36","author":"lindvall","year":"2002","journal-title":"Lectures on the Coupling Method"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/5.1.10"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677000"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(80)90084-0"},{"key":"ref40","article-title":"Type-Based Complexity Analysis of Probabilistic Functional Programs (Technical Report)","author":"avanzini","year":"2019","journal-title":"Tech Rep"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2004.160.781"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009873"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49498-1_15"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706327"},{"key":"ref15","first-page":"132","article-title":"On probabilistic term rewriting","volume":"10818","author":"avanzini","year":"2018","journal-title":"Proc of 14th FLOPS ser LNCS"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/11693024_3"},{"key":"ref17","first-page":"1","article-title":"Linear dependent types and relative completeness","volume":"8","author":"dal","year":"2011","journal-title":"LMCS"},{"key":"ref18","first-page":"393","article-title":"Probabilistic termination by monadic affine sized typing","volume":"10201","author":"dal lago","year":"2017","journal-title":"Proc of 26th ESOP ser LNCS"},{"key":"ref19","first-page":"8:1","article-title":"On intersection types and probabilistic lambda calculi","author":"breuvart","year":"2018","journal-title":"Proc of 20th PPDP"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1515\/9781400882618-010"},{"key":"ref27","first-page":"123","article-title":"Proving termination of probabilistic programs using patterns","volume":"7358","author":"esparza","year":"2012","journal-title":"Proc of 24th CAV ser LNCS"},{"key":"ref3","first-page":"1","article-title":"Robotic mapping: A survey","volume":"1","author":"thrun","year":"2002","journal-title":"Exploring Artificial Intelligence in the New Millennium"},{"key":"ref6","first-page":"90","article-title":"Formal certification of code-based cryptographic proofs","author":"barthe","year":"2009","journal-title":"Proc of 36th POPL ACM"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837639"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref8","first-page":"220","article-title":"Church: A language for generative models","author":"goodman","year":"2008","journal-title":"Proc of 24th UAI"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_5"},{"key":"ref2","author":"pearl","year":"1989","journal-title":"Probabilistic Reasoning in Intelligent Systems-Networks of Plausible Inference"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23461-8_36"},{"key":"ref1","author":"manning","year":"2001","journal-title":"Foundations of Statistical Natural Language Processing"},{"key":"ref20","author":"mosteller","year":"1987","journal-title":"Fifty challenging problems in probability with solutions"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/237721.240882"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129516000396"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009896"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2307\/2273659"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45610-4_18"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32495-6_1"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Vancouver, BC, Canada","start":{"date-parts":[[2019,6,24]]},"end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785725.pdf?arnumber=8785725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:18:53Z","timestamp":1658247533000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785725\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785725","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}