{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:06Z","timestamp":1750220166987,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T00:00:00Z","timestamp":1665014400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"FAPEMIG","award":["APQ-01683-21"],"award-info":[{"award-number":["APQ-01683-21"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,6]]},"DOI":"10.1145\/3561320.3561326","type":"proceedings-article","created":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T22:11:32Z","timestamp":1664230292000},"page":"8-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Type-Directed Algorithm to Generate Random Well-Formed Parsing Expression Grammars"],"prefix":"10.1145","author":[{"given":"Elton Maximo","family":"Cardoso","sequence":"first","affiliation":[{"name":"Universidade Federal de Ouro Preto, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel Freitas","family":"Pereira","sequence":"additional","affiliation":[{"name":"Universidade Federal de Juiz de Fora, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Regina Sarah Monferrari Amorim","family":"De Paula","sequence":"additional","affiliation":[{"name":"Universidade Federal de Juiz de Fora, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonardo Vieira Dos Santos","family":"Reis","sequence":"additional","affiliation":[{"name":"Universidade Federal de Juiz de Fora, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo Geraldo","family":"Ribeiro","sequence":"additional","affiliation":[{"name":"Universidade Federal de Ouro Preto, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,10,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328897.1328443"},{"key":"e_1_3_2_1_2_1","unstructured":"Nick Benton. 2006. Machine Obstructed Proof (Abstract). https:\/\/www.microsoft.com\/en-us\/research\/publication\/machine-obstructed-proof-abstract\/  Nick Benton. 2006. Machine Obstructed Proof (Abstract). https:\/\/www.microsoft.com\/en-us\/research\/publication\/machine-obstructed-proof-abstract\/"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372885.3373836"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/321239.321249"},{"volume-title":"Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant","author":"Chlipala Adam","key":"e_1_3_2_1_5_1","unstructured":"Adam Chlipala . 2013. Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant . The MIT Press . Adam Chlipala. 2013. Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant. The MIT Press."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/357766.351266"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2020.102494"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2019.04.002"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3426425.3426944"},{"key":"e_1_3_2_1_10_1","unstructured":"E M. Cardoso R. G. Ribeiro L. V. S. Reis D. F. Pereira R. S. M. A. de Paula. 2022. peg-gen. https:\/\/github.com\/lives-group\/pegwfgen  E M. Cardoso R. G. Ribeiro L. V. S. Reis D. F. Pereira R. S. M. A. de Paula. 2022. peg-gen. https:\/\/github.com\/lives-group\/pegwfgen"},{"key":"e_1_3_2_1_11_1","volume-title":"Semantics Engineering with PLT Redex","author":"Felleisen Matthias","unstructured":"Matthias Felleisen , Robert\u00a0Bruce Findler , and Matthew Flatt . 2009. Semantics Engineering with PLT Redex ( 1 st ed.). The MIT Press . Matthias Felleisen, Robert\u00a0Bruce Findler, and Matthew Flatt. 2009. Semantics Engineering with PLT Redex(1st ed.). The MIT Press.","edition":"1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46669-8_16"},{"key":"e_1_3_2_1_13_1","volume-title":"Reference: Racket. Technical Report PLT-TR-2010-1","author":"Flatt Matthew","year":"2010","unstructured":"Matthew Flatt and PLT. 2010 . Reference: Racket. Technical Report PLT-TR-2010-1 . PLT Design Inc .https:\/\/racket-lang.org\/tr1\/. Matthew Flatt and PLT. 2010. Reference: Racket. Technical Report PLT-TR-2010-1. PLT Design Inc.https:\/\/racket-lang.org\/tr1\/."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964011"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500574"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.892"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103691"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-7(2:18)2011"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314625"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2014.01.012"},{"volume-title":"Mathematics of Program Construction, Ralf Hinze and Janis Voigtl\u00e4nder (Eds.)","author":"McBride Conor","key":"e_1_3_2_1_21_1","unstructured":"Conor McBride . 2015. Turing-Completeness Totally Free . In Mathematics of Program Construction, Ralf Hinze and Janis Voigtl\u00e4nder (Eds.) . Springer International Publishing , Cham , 257\u2013275. Conor McBride. 2015. Turing-Completeness Totally Free. In Mathematics of Program Construction, Ralf Hinze and Janis Voigtl\u00e4nder (Eds.). Springer International Publishing, Cham, 257\u2013275."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851613.2851750"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2014.01.013"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21254-3_32"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10542-0"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2738007"},{"key":"e_1_3_2_1_27_1","unstructured":"Bogdan Popa. 2020. Rackcheck: property testing. Retrieved 2022-03-20 from https:\/\/docs.racket-lang.org\/rackcheck\/index.html  Bogdan Popa. 2020. Rackcheck: property testing. Retrieved 2022-03-20 from https:\/\/docs.racket-lang.org\/rackcheck\/index.html"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355378.3355388"},{"volume-title":"Verified Functional Programming in Agda","author":"Stump Aaron","key":"e_1_3_2_1_29_1","unstructured":"Aaron Stump . 2016. Verified Functional Programming in Agda . Association for Computing Machinery and Morgan Claypool . Aaron Stump. 2016. Verified Functional Programming in Agda. Association for Computing Machinery and Morgan Claypool."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71237-6_19"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328408.1328424"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993316.1993532"}],"event":{"name":"SBLP 2022: XXVI Brazilian Symposium on Programming Languages","acronym":"SBLP 2022","location":"Virtual Event Brazil"},"container-title":["Proceedings of the XXVI Brazilian Symposium on Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561320.3561326","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3561320.3561326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:35Z","timestamp":1750186835000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561320.3561326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,6]]},"references-count":32,"alternative-id":["10.1145\/3561320.3561326","10.1145\/3561320"],"URL":"https:\/\/doi.org\/10.1145\/3561320.3561326","relation":{},"subject":[],"published":{"date-parts":[[2022,10,6]]},"assertion":[{"value":"2022-10-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}