{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T03:26:47Z","timestamp":1781839607540,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC CoG 818616"],"award-info":[{"award-number":["ERC CoG 818616"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,2]]},"DOI":"10.1145\/3531130.3533361","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Curry and Howard Meet Borel"],"prefix":"10.1145","author":[{"given":"Melissa","family":"Antonelli","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Bologna, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ugo","family":"Dal Lago","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Bologna & INRIA Sophia Antipolis, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Pistone","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Bologna, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. of CSL","author":"Alechina N.","year":"2021","unstructured":"N. Alechina , M. Mendler , V. de Paiva , and E. Ritter . 2001. Categorical and Kripke Semantics for Constructive S4 Modal Logic . In Proc. of CSL 2021 . Springer, Berlin, Heidelberg, 292\u2013307. N. Alechina, M. Mendler, V. de Paiva, and E. Ritter. 2001. Categorical and Kripke Semantics for Constructive S4 Modal Logic. In Proc. of CSL 2021. Springer, Berlin, Heidelberg, 292\u2013307."},{"key":"e_1_3_2_1_2_1","volume-title":"Proc.\u00a0of ICTCS 2021","author":"Antonelli M.","unstructured":"M. Antonelli , U. Dal\u00a0Lago , and P. Pistone . 2021. On Counting Propositional Logic and Wagner\u2019s Hierarchy . In Proc.\u00a0of ICTCS 2021 , Vol.\u00a03072. CEUR Workshop Proceedings, Aachen, 107\u2013121. M. Antonelli, U. Dal\u00a0Lago, and P. Pistone. 2021. On Counting Propositional Logic and Wagner\u2019s Hierarchy. In Proc.\u00a0of ICTCS 2021, Vol.\u00a03072. CEUR Workshop Proceedings, Aachen, 107\u2013121."},{"key":"e_1_3_2_1_3_1","volume-title":"Proc.\u00a0of CiE","author":"Antonelli M.","year":"2021","unstructured":"M. Antonelli , U. Dal\u00a0Lago , and P. Pistone . 2021. On Measure Quantifiers in First-Order Arithmetic . In Proc.\u00a0of CiE 2021 . Springer, Switzerland, 12\u201324. M. Antonelli, U. Dal\u00a0Lago, and P. Pistone. 2021. On Measure Quantifiers in First-Order Arithmetic. In Proc.\u00a0of CiE 2021. Springer, Switzerland, 12\u201324."},{"key":"e_1_3_2_1_4_1","volume-title":"Curry and Howard Meet Borel (Long Version). (March","author":"Antonelli M.","year":"2022","unstructured":"M. Antonelli , U. Dal\u00a0Lago , and P. Pistone . 2022 . Curry and Howard Meet Borel (Long Version). (March 2022 ). https:\/\/arxiv.org\/abs\/2203.11265. M. Antonelli, U. Dal\u00a0Lago, and P. Pistone. 2022. Curry and Howard Meet Borel (Long Version). (March 2022). https:\/\/arxiv.org\/abs\/2203.11265."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1990.tb00296.x"},{"key":"e_1_3_2_1_6_1","volume-title":"Uncertainty in Artificial Intelligence. Machine Intelligence and Pattern Recognition, Vol.\u00a09. North-Holland","author":"Bacchus F.","unstructured":"F. Bacchus . 1990. On Probability Distributions over Possible Worlds . In Uncertainty in Artificial Intelligence. Machine Intelligence and Pattern Recognition, Vol.\u00a09. North-Holland , Amsterdam , 217\u2013226. F. Bacchus. 1990. On Probability Distributions over Possible Worlds. In Uncertainty in Artificial Intelligence. Machine Intelligence and Pattern Recognition, Vol.\u00a09. North-Holland, Amsterdam, 217\u2013226."},{"key":"e_1_3_2_1_7_1","volume-title":"Representing and Reasoning with Probabilistic Knowledge","author":"Bacchus F.","unstructured":"F. Bacchus . 1990. Representing and Reasoning with Probabilistic Knowledge . MIT Press , Cambridge MA . F. Bacchus. 1990. Representing and Reasoning with Probabilistic Knowledge. MIT Press, Cambridge MA."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898002998"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"J. Bessai A. Dudenhefner B. D\u00fcdder M. Martens and J. Rehof. 2016. Combinatory Process Synthesis. In Leveraging Applications of Formal Methods Verification and Validation: Foundational Techniques T.\u00a0Margaria and B.\u00a0Steffen (Eds.). Springer International Publishing Cham 266\u2013281.  J. Bessai A. Dudenhefner B. D\u00fcdder M. Martens and J. Rehof. 2016. Combinatory Process Synthesis. In Leveraging Applications of Formal Methods Verification and Validation: Foundational Techniques T.\u00a0Margaria and B.\u00a0Steffen (Eds.). Springer International Publishing Cham 266\u2013281.","DOI":"10.1007\/978-3-319-47166-2_19"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc.\u00a0of RTA","author":"Bournez O.","year":"2002","unstructured":"O. Bournez and C. Kirchner . 2002. Probabilistic Rewrite Strategies. Applications to ELAN . In Proc.\u00a0of RTA 2002 . Springer, Berlin, Heidelberg, 252\u2013266. O. Bournez and C. Kirchner. 2002. Probabilistic Rewrite Strategies. Applications to ELAN. In Proc.\u00a0of RTA 2002. Springer, Berlin, Heidelberg, 252\u2013266."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236950.3236968"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of ESOP","author":"Brunel A.","year":"2014","unstructured":"A. Brunel , M. Gaboardi , D. Mazza , and S. Zdancewic . 2014. A Core Quantitative Coeffect Calculus . In Proc. of ESOP 2014 . Springer, Berlin, Heidelberg, 351\u2013370. A. Brunel, M. Gaboardi, D. Mazza, and S. Zdancewic. 2014. A Core Quantitative Coeffect Calculus. In Proc. of ESOP 2014. Springer, Berlin, Heidelberg, 351\u2013370."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129514000218"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. of POPL","author":"Curien P.-L.","year":"2016","unstructured":"P.-L. Curien , M. Fiore , and G. Munch-Maccagnoni . 2016. A Theory of Effects and Resources: Adjunction Models and Polarised Calculi . In Proc. of POPL 2016 . Association for Computing Machinery, New York, NY, 44\u201356. P.-L. Curien, M. Fiore, and G. Munch-Maccagnoni. 2016. A Theory of Effects and Resources: Adjunction Models and Polarised Calculi. In Proc. of POPL 2016. Association for Computing Machinery, New York, NY, 44\u201356."},{"key":"e_1_3_2_1_15_1","unstructured":"H.\u00a0B. Curry and R. Feys. 1958. Combinatory Logic. Vol. I. North-Holland Amsterdam.  H.\u00a0B. Curry and R. Feys. 1958. Combinatory Logic. Vol. I. North-Holland Amsterdam."},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. of POPL","author":"Dal\u00a0Lago U.","year":"2017","unstructured":"U. Dal\u00a0Lago , C. Faggian , B. Valiron , and A. Yoshimizu . 2017. The Geometry of Parallelism: Classical, Probabilistic, and Quantum Effects . In Proc. of POPL 2017 . Association for Computing Machinery, New York, NY, 833\u2013845. U. Dal\u00a0Lago, C. Faggian, B. Valiron, and A. Yoshimizu. 2017. The Geometry of Parallelism: Classical, Probabilistic, and Quantum Effects. In Proc. of POPL 2017. Association for Computing Machinery, New York, NY, 833\u2013845."},{"key":"e_1_3_2_1_17_1","first-page":"10","article-title":"Probabilistic Termination by Monadic Affine Sized Typing","volume":"41","author":"Dal\u00a0Lago U.","year":"2019","unstructured":"U. Dal\u00a0Lago and C. Grellois . 2019 . Probabilistic Termination by Monadic Affine Sized Typing . ACM Transactions on Programming Languages and Systems 41 , 2 (2019), 10 \u2013 65 . U. Dal\u00a0Lago and C. Grellois. 2019. Probabilistic Termination by Monadic Affine Sized Typing. ACM Transactions on Programming Languages and Systems 41, 2 (2019), 10\u201365.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. of FoSSaCS","author":"Dal\u00a0Lago U.","year":"2020","unstructured":"U. Dal\u00a0Lago , G. Guerrieri , and W. Heijltjes . 2020. Decomposing Probabilistic Lambda-Calculi . In Proc. of FoSSaCS 2020 . Springer, Cham, 136\u2013156. U. Dal\u00a0Lago, G. Guerrieri, and W. Heijltjes. 2020. Decomposing Probabilistic Lambda-Calculi. In Proc. of FoSSaCS 2020. Springer, Cham, 136\u2013156."},{"key":"e_1_3_2_1_19_1","volume-title":"Revisited. In Proc. of TLCA","author":"Dal\u00a0Lago U.","year":"2009","unstructured":"U. Dal\u00a0Lago and M. Hofmann . 2009. Bounded Linear Logic , Revisited. In Proc. of TLCA 2009 . Springer, Berlin Heidelberg, 80\u201394. U. Dal\u00a0Lago and M. Hofmann. 2009. Bounded Linear Logic, Revisited. In Proc. of TLCA 2009. Springer, Berlin Heidelberg, 80\u201394."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/382780.382785"},{"key":"e_1_3_2_1_21_1","first-page":"1","article-title":"Probabilistic Call by Push Value","volume":"15","author":"Ehrhard T.","year":"2018","unstructured":"T. Ehrhard and C. Tasson . 2018 . Probabilistic Call by Push Value . Logical Methods in Computer Science 15 , 1 (2018), 1 \u2013 46 . T. Ehrhard and C. Tasson. 2018. Probabilistic Call by Push Value. Logical Methods in Computer Science 15, 1 (2018), 1\u201346.","journal-title":"Logical Methods in Computer Science"},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. of POPL","author":"Ehrhard T.","year":"2014","unstructured":"T. Ehrhard , C. Tasson , and M. Pagani . 2014. Probabilistic Coherence Spaces Are Fully Abstract for Probabilistic PCF . In Proc. of POPL 2014 . Association for Computing Machinery, New York, NY, 309\u2013320. T. Ehrhard, C. Tasson, and M. Pagani. 2014. Probabilistic Coherence Spaces Are Fully Abstract for Probabilistic PCF. In Proc. of POPL 2014. Association for Computing Machinery, New York, NY, 309\u2013320."},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. of LICS","author":"Faggian C.","year":"2019","unstructured":"C. Faggian and S. Ronchi\u00a0della Rocca . 2019. Lambda-Calculus and Probabilistic Computation . In Proc. of LICS 2019 . IEEE, Vancouver, Canada, 1\u201313. C. Faggian and S. Ronchi\u00a0della Rocca. 2019. Lambda-Calculus and Probabilistic Computation. In Proc. of LICS 2019. IEEE, Vancouver, Canada, 1\u201313."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/174652.174658"},{"key":"e_1_3_2_1_25_1","unstructured":"R. Furber R. Mardare and M. Mio. 2020. Probabilistic logics based on Riesz spaces. Logical Methods in Computer Science 16 1 (2020) 6:1\u20136:45.  R. Furber R. Mardare and M. Mio. 2020. Probabilistic logics based on Riesz spaces. Logical Methods in Computer Science 16 1 (2020) 6:1\u20136:45."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_18"},{"key":"e_1_3_2_1_28_1","volume-title":"Between Logic and Quantic: a Tract","author":"Girard J.-Y.","unstructured":"J.-Y. Girard . 2004. Between Logic and Quantic: a Tract . London Mathematical Society Lecture Note Series, Vol .\u00a0316. Cambridge University Press , Cambridge, 346\u2013381. J.-Y. Girard. 2004. Between Logic and Quantic: a Tract. London Mathematical Society Lecture Note Series, Vol.\u00a0316. Cambridge University Press, Cambridge, 346\u2013381."},{"key":"e_1_3_2_1_29_1","unstructured":"J.-Y. Girard Y. Lafont and P. Taylor. 1989. Proofs and Types. Cambridge Tracts in Theoretical Computer Science Vol.\u00a07. Cambridge University Press New York NY.  J.-Y. Girard Y. Lafont and P. Taylor. 1989. Proofs and Types. Cambridge Tracts in Theoretical Computer Science Vol.\u00a07. Cambridge University Press New York NY."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90386-T"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90019-V"},{"key":"e_1_3_2_1_32_1","volume-title":"Reasoning About Uncertainty","author":"Halpern J.Y.","unstructured":"J.Y. Halpern . 2003. Reasoning About Uncertainty . MIT Press , Cambridge MA . J.Y. Halpern. 2003. Reasoning About Uncertainty. MIT Press, Cambridge MA."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211866"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"F. Henglein and J. Rehof. 2016. Modal Intersection Types Two-Level Languages and Staged Synthesis. In Semantics Logics and Calculi: Essays Dedicated to Hanne Riis Nielson and Flemming Nielson on the Occasion of Their 60th Birthdays. Springer International Publishing Cham 289\u2013312.  F. Henglein and J. Rehof. 2016. Modal Intersection Types Two-Level Languages and Staged Synthesis. In Semantics Logics and Calculi: Essays Dedicated to Hanne Riis Nielson and Flemming Nielson on the Occasion of Their 60th Birthdays. Springer International Publishing Cham 289\u2013312.","DOI":"10.1007\/978-3-319-27810-0_15"},{"key":"e_1_3_2_1_35_1","volume-title":"The Formula-as-Types Notion of Construction","author":"Howard W.A.","year":"1969","unstructured":"W.A. Howard . 1980. The Formula-as-Types Notion of Construction ( 1969 ). In To H.B. Curry. Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press , Cambridge, MA. W.A. Howard. 1980. The Formula-as-Types Notion of Construction (1969). In To H.B. Curry. Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, Cambridge, MA."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535846"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89366-2_6"},{"key":"e_1_3_2_1_38_1","volume-title":"Proc. of LICS","author":"Kobayashi N.","year":"2019","unstructured":"N. Kobayashi , U. Dal\u00a0Lago , and C. Grellois . 2019. On the Termination Problem for Probabilistic Higher-Order Recursive Programs . In Proc. of LICS 2019 . IEEE, Vancouver, France, 1\u201314. N. Kobayashi, U. Dal\u00a0Lago, and C. Grellois. 2019. On the Termination Problem for Probabilistic Higher-Order Recursive Programs. In Proc. of LICS 2019. IEEE, Vancouver, France, 1\u201314."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90036-2"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)91022-1"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71945-1"},{"key":"e_1_3_2_1_42_1","volume-title":"Proc. of LFCS","author":"Michalewski H.","year":"2016","unstructured":"H. Michalewski and M. Mio . 2016. Measure Quantifiers in Monadic Second Order Logic . In Proc. of LFCS 2016 . Springer, Cham, 267\u2013282. H. Michalewski and M. Mio. 2016. Measure Quantifiers in Monadic Second Order Logic. In Proc. of LFCS 2016. Springer, Cham, 267\u2013282."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(2:7)2012"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273708"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(86)90031-7"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/190908.190918"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90045-5"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013061"},{"key":"e_1_3_2_1_49_1","volume-title":"Proc. of TARK \u201986","author":"Plotkin G.","unstructured":"G. Plotkin and C. Stirling . 1986. A Framework for Intuitionistic Modal Logics: Extended Abstract . In Proc. of TARK \u201986 . Morgan Kaufmann Publishers Inc., San Francisco, CA, 399\u2013406. G. Plotkin and C. Stirling. 1986. A Framework for Intuitionistic Modal Logics: Extended Abstract. In Proc. of TARK \u201986. Morgan Kaufmann Publishers Inc., San Francisco, CA, 399\u2013406."},{"key":"e_1_3_2_1_50_1","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"Puterman L.","unstructured":"M.\u00a0 L. Puterman . 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming . John Wiley & Sons, Inc. , USA. M.\u00a0L. Puterman. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., USA."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-5833-1"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"M.H. Sorensen and P. Urzyczyn. 2006. Lectures on the Curry-Howard isomorphism. Studies in Logic and the Foundations of Mathematics Vol.\u00a0149. Elsevier Amsterdam.  M.H. Sorensen and P. Urzyczyn. 2006. Lectures on the Curry-Howard isomorphism. Studies in Logic and the Foundations of Mathematics Vol.\u00a0149. Elsevier Amsterdam.","DOI":"10.1016\/S0049-237X(06)80005-4"},{"key":"e_1_3_2_1_54_1","volume-title":"Model-Theoretic Logics. Vol.\u00a08","author":"Steinhorn C.I.","unstructured":"C.I. Steinhorn . 1985. Borel Structures and Measure and Category Logics . In Model-Theoretic Logics. Vol.\u00a08 . Springer-Verlag , New York , Berlin, Heidelberg, Tokyo, 579\u2013596. C.I. Steinhorn. 1985. Borel Structures and Measure and Category Logics. In Model-Theoretic Logics. Vol.\u00a08. Springer-Verlag, New York, Berlin, Heidelberg, Tokyo, 579\u2013596."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364527.2364568"},{"key":"e_1_3_2_1_56_1","volume-title":"Frege Conference 1984: Proceedings of the International Conference held at Schwerin(Mathematische Forschung, Vol.\u00a020)","author":"Wagner K.W.","year":"1984","unstructured":"K.W. Wagner . 1984 . Compact descriptions and the counting polynomial-time hierarchy . In Frege Conference 1984: Proceedings of the International Conference held at Schwerin(Mathematische Forschung, Vol.\u00a020) . Akademie-Verlag, Berlin, 383\u2013392. K.W. Wagner. 1984. Compact descriptions and the counting polynomial-time hierarchy. In Frege Conference 1984: Proceedings of the International Conference held at Schwerin(Mathematische Forschung, Vol.\u00a020). Akademie-Verlag, Berlin, 383\u2013392."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/21559.21562"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289117"},{"key":"e_1_3_2_1_59_1","volume-title":"Proc. of ICFP","author":"Wang D.","year":"2020","unstructured":"D. Wang , D.\u00a0 M. Kahn , and J. Hofmann . 2020. Raising Expectations: Automating Expected Cost Analysis with Types . In Proc. of ICFP 2020 , Vol.\u00a04. Association for Computing Machinery, New York, NY, 1\u201331. D. Wang, D.\u00a0M. Kahn, and J. Hofmann. 2020. Raising Expectations: Automating Expected Cost Analysis with Types. In Proc. of ICFP 2020, Vol.\u00a04. Association for Computing Machinery, New York, NY, 1\u201331."},{"key":"e_1_3_2_1_60_1","unstructured":"J. Warrell and M.\u00a0B. Gerstein. 2018. Dependent Type Networks: A Probabilistic Logic via the Curry-Howard Correspondence in a System of Probabilistic Dependent Types. (2018). unpublished manuscript http:\/\/papers.gersteinlab.org\/papers\/UDL-19\/index-all.html.  J. Warrell and M.\u00a0B. Gerstein. 2018. Dependent Type Networks: A Probabilistic Logic via the Curry-Howard Correspondence in a System of Probabilistic Dependent Types. (2018). unpublished manuscript http:\/\/papers.gersteinlab.org\/papers\/UDL-19\/index-all.html."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90037-2"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","unstructured":"S. Zachos and H. Heller. 1986. A decisive characterization of BPP. Information and Control 1\u20133 (1986) 125\u2013135.  S. Zachos and H. Heller. 1986. A decisive characterization of BPP. Information and Control 1\u20133 (1986) 125\u2013135.","DOI":"10.1016\/S0019-9958(86)80044-4"},{"key":"e_1_3_2_1_63_1","volume-title":"Proc. of ICFP","author":"Zyuzin N.","year":"2021","unstructured":"N. Zyuzin and A. Nanevski . 2021. Contextual Modal Types for Algebraic Effects and Handlers . In Proc. of ICFP 2021 . Association for Computing Machinery, New York, NY, 1\u201329. N. Zyuzin and A. Nanevski. 2021. Contextual Modal Types for Algebraic Effects and Handlers. In Proc. of ICFP 2021. Association for Computing Machinery, New York, NY, 1\u201329."}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Haifa Israel","acronym":"LICS '22","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"]},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533361","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:10Z","timestamp":1750186930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":61,"alternative-id":["10.1145\/3531130.3533361","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533361","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}