{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:28Z","timestamp":1750220908341,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T00:00:00Z","timestamp":1570406400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,10,7]]},"DOI":"10.1145\/3354166.3354170","type":"proceedings-article","created":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T12:58:36Z","timestamp":1569329916000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Property-Based Testing via Proof Reconstruction"],"prefix":"10.1145","author":[{"given":"Roberto","family":"Blanco","sequence":"first","affiliation":[{"name":"INRIA Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dale","family":"Miller","sequence":"additional","affiliation":[{"name":"INRIA Saclay & LIX, \u00c9cole, Polytechnique, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Momigliano","sequence":"additional","affiliation":[{"name":"DI, Universit\u00e0 degli Studi di Milano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,10,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35308-6_15"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.3.297"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322339"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158104"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071368.2071370"},{"key":"e_1_3_2_1_6_1","article-title":"Abella: A System for Reasoning about Relational Specifications","volume":"7","author":"Baelde David","year":"2014","unstructured":"David Baelde , Kaustuv Chaudhuri , Andrew Gacek , Dale Miller , Gopalan Nadathur , Alwen Tiu , and Yuting Wang . 2014 . Abella: A System for Reasoning about Relational Specifications . Journal of Formalized Reasoning 7 , 2 (2014). David Baelde, Kaustuv Chaudhuri, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu, and Yuting Wang. 2014. Abella: A System for Reasoning about Relational Specifications. Journal of Formalized Reasoning 7, 2 (2014).","journal-title":"Journal of Formalized Reasoning"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73595-3_28"},{"volume-title":"FroCoS (Lecture Notes in Computer Science), Cesare Tinelli and Viorica Sofronie-Stokkermans (Eds.)","author":"Blanchette Jasmin Christian","key":"e_1_3_2_1_8_1","unstructured":"Jasmin Christian Blanchette , Lukas Bulwahn , and Tobias Nipkow . 2011. Automatic Proof and Disproof in Isabelle\/HOL . In FroCoS (Lecture Notes in Computer Science), Cesare Tinelli and Viorica Sofronie-Stokkermans (Eds.) , Vol. 6989 . Springer , 12--27. Jasmin Christian Blanchette, Lukas Bulwahn, and Tobias Nipkow. 2011. Automatic Proof and Disproof in Isabelle\/HOL. In FroCoS (Lecture Notes in Computer Science), Cesare Tinelli and Viorica Sofronie-Stokkermans (Eds.), Vol. 6989. Springer, 12--27."},{"volume-title":"Automated Deduction - CADE 26 - 26th International Conference on Automated Deduction (Lecture Notes in Computer Science), Leonardo de Moura (Ed.)","author":"Blanco Roberto","key":"e_1_3_2_1_9_1","unstructured":"Roberto Blanco , Zakaria Chihani , and Dale Miller . 2017. Translating Between Implicit and Explicit Versions of Proof . In Automated Deduction - CADE 26 - 26th International Conference on Automated Deduction (Lecture Notes in Computer Science), Leonardo de Moura (Ed.) , Vol. 10395 . Springer , 255--273. Roberto Blanco, Zakaria Chihani, and Dale Miller. 2017. Translating Between Implicit and Explicit Versions of Proof. In Automated Deduction - CADE 26 - 26th International Conference on Automated Deduction (Lecture Notes in Computer Science), Leonardo de Moura (Ed.), Vol. 10395. Springer, 255--273."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.197.2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0164-1212(86)90004-X"},{"key":"e_1_3_2_1_12_1","volume-title":"Certified Programs and Proofs - Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings (Lecture Notes in Computer Science), Chris Hawblitzel and Dale Miller (Eds.)","volume":"7679","author":"Bulwahn Lukas","year":"2012","unstructured":"Lukas Bulwahn . 2012 . The New Quickcheck for Isabelle - Random, Exhaustive and Symbolic Testing under One Roof . In Certified Programs and Proofs - Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings (Lecture Notes in Computer Science), Chris Hawblitzel and Dale Miller (Eds.) , Vol. 7679 . Springer, 92--108. https:\/\/doi.org\/10.1007\/978-3-642-35308-6_10 10.1007\/978-3-642-35308-6_10 Lukas Bulwahn. 2012. The New Quickcheck for Isabelle - Random, Exhaustive and Symbolic Testing under One Roof. In Certified Programs and Proofs - Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings (Lecture Notes in Computer Science), Chris Hawblitzel and Dale Miller (Eds.), Vol. 7679. Springer, 92--108. https:\/\/doi.org\/10.1007\/978-3-642-35308-6_10"},{"key":"e_1_3_2_1_13_1","volume-title":"A mechanized metatheory model checker. Theory and Practice of Logic Programming 17, 3","author":"Cheney James","year":"2017","unstructured":"James Cheney and Alberto Momigliano . 2017. α Check : A mechanized metatheory model checker. Theory and Practice of Logic Programming 17, 3 ( 2017 ), 311\u00e2\u0102\u015f352. James Cheney and Alberto Momigliano. 2017. α Check: A mechanized metatheory model checker. Theory and Practice of Logic Programming 17, 3 (2017), 311\u00e2\u0102\u015f352."},{"key":"e_1_3_2_1_14_1","volume-title":"TAP 2016, Vienna, Austria, July 5-7, 2016, Proceedings (Lecture Notes in Computer Science), Bernhard K. Aichernig and Carlo A. Furia (Eds.)","volume":"9762","author":"Cheney James","year":"2016","unstructured":"James Cheney , Alberto Momigliano , and Matteo Pessina . 2016 . Advances in Property-Based Testing for αProlog. In Tests and Proofs - 10th International Conference , TAP 2016, Vienna, Austria, July 5-7, 2016, Proceedings (Lecture Notes in Computer Science), Bernhard K. Aichernig and Carlo A. Furia (Eds.) , Vol. 9762 . Springer, 37--56. James Cheney, Alberto Momigliano, and Matteo Pessina. 2016. Advances in Property-Based Testing for αProlog. In Tests and Proofs - 10th International Conference, TAP 2016, Vienna, Austria, July 5-7, 2016, Proceedings (Lecture Notes in Computer Science), Bernhard K. Aichernig and Carlo A. Furia (Eds.), Vol. 9762. Springer, 37--56."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-016-9380-6"},{"key":"e_1_3_2_1_16_1","volume-title":"Palka","author":"Claessen Koen","year":"2015","unstructured":"Koen Claessen , Jonas Dureg\u00e5rd , and Michal H . Palka . 2015 . Generating constrained random data with uniform distribution. J. Funct. Program . 25 (2015). https:\/\/doi.org\/10.1017\/S0956796815000143 10.1017\/S0956796815000143 Koen Claessen, Jonas Dureg\u00e5rd, and Michal H. Palka. 2015. Generating constrained random data with uniform distribution. J. Funct. Program. 25 (2015). https:\/\/doi.org\/10.1017\/S0956796815000143"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351266"},{"volume-title":"Negation as failure","author":"Clark K. L.","key":"e_1_3_2_1_18_1","unstructured":"K. L. Clark . 1978. Negation as failure . In Logic and Data Bases, J. Gallaire and J. Minker (Eds.). Plenum Press , New York , 293--322. K. L. Clark. 1978. Negation as failure. In Logic and Data Bases, J. Gallaire and J. Minker (Eds.). Plenum Press, New York, 293--322."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48899-7_32"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364506.2364515"},{"key":"e_1_3_2_1_21_1","volume-title":"Robert Bruce Findler, and Matthew Flatt","author":"Felleisen Matthias","year":"2009","unstructured":"Matthias Felleisen , Robert Bruce Findler, and Matthew Flatt . 2009 . Semantics Engineering with PLT Redex. The MIT Press . Matthias Felleisen, Robert Bruce Findler, and Matthew Flatt. 2009. Semantics Engineering with PLT Redex. The MIT Press."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9194-x"},{"volume-title":"ESOP (Lecture Notes in Computer Science)","author":"Fetscher Burke","key":"e_1_3_2_1_23_1","unstructured":"Burke Fetscher , Koen Claessen , Michal H. Palka , John Hughes , and Robert Bruce Findler . 2015. Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System . In ESOP (Lecture Notes in Computer Science) , Vol. 9032 . Springer , 383--405. Burke Fetscher, Koen Claessen, Michal H. Palka, John Hughes, and Robert Bruce Findler. 2015. Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System. In ESOP (Lecture Notes in Computer Science), Vol. 9032. Springer, 383--405."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000076"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/ext071"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.33"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-011-9218-1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_3_2_1_29_1","volume-title":"A Fixpoint Theorem in Linear Logic. (Feb","author":"Girard Jean-Yves","year":"1992","unstructured":"Jean-Yves Girard . 1992. A Fixpoint Theorem in Linear Logic. (Feb . 1992 ). An email posting to the mailing list linear@cs.stanford.edu. Jean-Yves Girard. 1992. A Fixpoint Theorem in Linear Logic. (Feb. 1992). An email posting to the mailing list linear@cs.stanford.edu."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.238.1"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500574"},{"key":"e_1_3_2_1_32_1","volume-title":"9th International Symposium, PADL 2007","author":"Hughes John","year":"2007","unstructured":"John Hughes . 2007 . QuickCheck Testing for Fun and Profit. In Practical Aspects of Declarative Languages , 9th International Symposium, PADL 2007 , Nice, France , January 14-15, 2007 (Lecture Notes in Computer Science), Michael Hanus (Ed.), Vol. 4354. Springer, 1--32. John Hughes. 2007. QuickCheck Testing for Fun and Profit. In Practical Aspects of Declarative Languages, 9th International Symposium, PADL 2007, Nice, France, January 14-15, 2007 (Lecture Notes in Computer Science), Michael Hanus (Ed.), Vol. 4354. Springer, 1--32."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00244460"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103691"},{"key":"e_1_3_2_1_35_1","volume-title":"44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL). https:\/\/arxiv.org\/abs\/1607","author":"Lampropoulos Leonidas","year":"2017","unstructured":"Leonidas Lampropoulos , Diane Gallois-Wong , C\u0103t\u0103lin Hri\u0163cu , John Hughes , Benjamin C. Pierce , and Li-yao Xia. 2017 . Beginner's Luck: A Language for Random Generators . In 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL). https:\/\/arxiv.org\/abs\/1607 .05443 Leonidas Lampropoulos, Diane Gallois-Wong, C\u0103t\u0103lin Hri\u0163cu, John Hughes, Benjamin C. Pierce, and Li-yao Xia. 2017. Beginner's Luck: A Language for Random Generators. In 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL). https:\/\/arxiv.org\/abs\/1607.05443"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.041"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00171-1"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/504077.504080"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00168-2"},{"key":"e_1_3_2_1_40_1","volume-title":"Patrick Kasting, Flemming Nielson, and Hanne Riis Nielson.","author":"Midtgaard Jan","year":"2017","unstructured":"Jan Midtgaard , Mathias Nygaard Justesen , Patrick Kasting, Flemming Nielson, and Hanne Riis Nielson. 2017 . Effect-driven QuickChecking of compilers. PACMPL 1, ICFP ( 2017), 15:1--15.23. https:\/\/doi.org\/10.1145\/3110259 10.1145\/3110259 Jan Midtgaard, Mathias Nygaard Justesen, Patrick Kasting, Flemming Nielson, and Hanne Riis Nielson. 2017. Effect-driven QuickChecking of compilers. PACMPL 1, ICFP (2017), 15:1--15.23. https:\/\/doi.org\/10.1145\/3110259"},{"key":"e_1_3_2_1_41_1","article-title":"Mechanized Metatheory Revisited","author":"Miller Dale","year":"2018","unstructured":"Dale Miller . 2018 . Mechanized Metatheory Revisited . Journal of Automated Reasoning (04 Oct. 2018). https:\/\/doi.org\/10.1007\/s10817-018-9483-3 10.1007\/s10817-018-9483-3 Dale Miller. 2018. Mechanized Metatheory Revisited. Journal of Automated Reasoning (04 Oct. 2018). https:\/\/doi.org\/10.1007\/s10817-018-9483-3","journal-title":"Journal of Automated Reasoning (04"},{"volume-title":"Programming with Higher-Order Logic","author":"Miller Dale","key":"e_1_3_2_1_42_1","unstructured":"Dale Miller and Gopalan Nadathur . 2012. Programming with Higher-Order Logic . Cambridge University Press . Dale Miller and Gopalan Nadathur. 2012. Programming with Higher-Order Logic. Cambridge University Press."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90068-W"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.11.072"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094622.1094628"},{"volume-title":"CSL (Lecture Notes in Computer Science)","author":"Momigliano Alberto","key":"e_1_3_2_1_46_1","unstructured":"Alberto Momigliano . 2000. Elimination of Negation in a Logical Framework . In CSL (Lecture Notes in Computer Science) , Vol. 1862 . Springer , 411--426. Alberto Momigliano. 2000. Elimination of Negation in a Logical Framework. In CSL (Lecture Notes in Computer Science), Vol. 1862. Springer, 411--426."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364406.2364411"},{"volume-title":"Types in Logic Programming","author":"Nadathur Gopalan","key":"e_1_3_2_1_48_1","unstructured":"Gopalan Nadathur and Frank Pfenning . 1992. The type system of a higher-order logic programming language . In Types in Logic Programming , Frank Pfenning (Ed.). MIT Press , 245--283. Gopalan Nadathur and Frank Pfenning. 1992. The type system of a higher-order logic programming language. In Types in Logic Programming, Frank Pfenning (Ed.). MIT Press, 245--283."},{"key":"e_1_3_2_1_50_1","volume-title":"Proceedings of the 6th International Workshop on Automation of Software Test, AST 2011","author":"Palka Michal H.","year":"2011","unstructured":"Michal H. Palka , Koen Claessen , Alejandro Russo , and John Hughes . 2011 . Testing an optimising compiler by generating random lambda terms . In Proceedings of the 6th International Workshop on Automation of Software Test, AST 2011 , Waikiki, Honolulu, HI, USA , May 23-24, 2011, Antonia Bertolino, Howard Foster, and J. Jenny Li (Eds.). ACM, 91--97. https:\/\/doi.org\/10.1145\/1982595.1982615 10.1145\/1982595.1982615 Michal H. Palka, Koen Claessen, Alejandro Russo, and John Hughes. 2011. Testing an optimising compiler by generating random lambda terms. In Proceedings of the 6th International Workshop on Automation of Software Test, AST 2011, Waikiki, Honolulu, HI, USA, May 23-24, 2011, Antonia Bertolino, Howard Foster, and J. Jenny Li (Eds.). ACM, 91--97. https:\/\/doi.org\/10.1145\/1982595.1982615"},{"key":"e_1_3_2_1_51_1","volume-title":"Pierce","author":"Paraskevopoulou Zoe","year":"2015","unstructured":"Zoe Paraskevopoulou , Catalin Hritcu , Maxime D\u00e9n\u00e8s , Leonidas Lampropoulos , and Benjamin C . Pierce . 2015 . Foundational Property-Based Testing. In Interactive Theorem Proving - 6th International Conference, ITP 2015, Proceedings (Lecture Notes in Computer Science), Christian Urban and Xingyuan Zhang (Eds.), Vol. 9236 . Springer , 325--343. Zoe Paraskevopoulou, Catalin Hritcu, Maxime D\u00e9n\u00e8s, Leonidas Lampropoulos, and Benjamin C. Pierce. 2015. Foundational Property-Based Testing. In Interactive Theorem Proving - 6th International Conference, ITP 2015, Proceedings (Lecture Notes in Computer Science), Christian Urban and Xingyuan Zhang (Eds.), Vol. 9236. Springer, 325--343."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Giridhar Pemmasani Hai-Feng Guo Yifei Dong C. R. Ramakrishnan and I. V. Ramakrishnan. 2004. Online Justification for Tabled Logic Programs. In Functional and Logic Programming Yukiyoshi Kameyama and Peter J. Stuckey (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 24--38.  Giridhar Pemmasani Hai-Feng Guo Yifei Dong C. R. Ramakrishnan and I. V. Ramakrishnan. 2004. Online Justification for Tabled Logic Programs. In Functional and Logic Programming Yukiyoshi Kameyama and Peter J. Stuckey (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 24--38.","DOI":"10.1007\/978-3-540-24754-8_4"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48660-7_14"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14203-1_2"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"A. M. Pitts. 1997. Operationally Based Theories of Program Equivalence. In Semantics and Logics of Computation P. Dybjer and A. M. Pitts (Eds.).  A. M. Pitts. 1997. Operationally Based Theories of Program Equivalence. In Semantics and Logics of Computation P. Dybjer and A. M. Pitts (Eds.).","DOI":"10.1017\/CBO9780511526619"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Colin Runciman Matthew Naylor and Fredrik Lindblad. 2008. Smallcheck and Lazy Smallcheck: automatic exhaustive testing for small values. In Haskell. ACM 37--48.  Colin Runciman Matthew Naylor and Fredrik Lindblad. 2008. Smallcheck and Lazy Smallcheck: automatic exhaustive testing for small values. In Haskell. ACM 37--48.","DOI":"10.1145\/1543134.1411292"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2013.05.008"},{"key":"e_1_3_2_1_58_1","volume-title":"Proceedings of the 4th International Workshop on Extensions of Logic Programming, R. Dyckhoff (Ed.). Springer-Verlag LNAI 798","author":"Schroeder-Heister Peter","year":"1993","unstructured":"Peter Schroeder-Heister . 1993 . Definitional Reflection and the Completion . In Proceedings of the 4th International Workshop on Extensions of Logic Programming, R. Dyckhoff (Ed.). Springer-Verlag LNAI 798 , 333--347. Peter Schroeder-Heister. 1993. Definitional Reflection and the Completion. In Proceedings of the 4th International Workshop on Extensions of Logic Programming, R. Dyckhoff (Ed.). Springer-Verlag LNAI 798, 333--347."},{"key":"e_1_3_2_1_59_1","volume-title":"Rules of Definitional Reflection. In 8th Symp. on Logic in Computer Science, M. Vardi (Ed.). IEEE Computer Society Press, IEEE, 222--232","author":"Schroeder-Heister Peter","year":"1993","unstructured":"Peter Schroeder-Heister . 1993 . Rules of Definitional Reflection. In 8th Symp. on Logic in Computer Science, M. Vardi (Ed.). IEEE Computer Society Press, IEEE, 222--232 . https:\/\/doi.org\/10.1109\/LICS.1993.287585 10.1109\/LICS.1993.287585 Peter Schroeder-Heister. 1993. Rules of Definitional Reflection. In 8th Symp. on Logic in Computer Science, M. Vardi (Ed.). IEEE Computer Society Press, IEEE, 222--232. https:\/\/doi.org\/10.1109\/LICS.1993.287585"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007512.1007531"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1656242.1656248"}],"event":{"name":"PPDP '19: Principles and Practice of Programming Languages 2019","sponsor":["Sony Sony Corporation"],"location":"Porto Portugal","acronym":"PPDP '19"},"container-title":["Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3354166.3354170","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3354166.3354170","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:56Z","timestamp":1750203896000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3354166.3354170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,7]]},"references-count":60,"alternative-id":["10.1145\/3354166.3354170","10.1145\/3354166"],"URL":"https:\/\/doi.org\/10.1145\/3354166.3354170","relation":{},"subject":[],"published":{"date-parts":[[2019,10,7]]},"assertion":[{"value":"2019-10-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}