{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:51:18Z","timestamp":1770292278516,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,1,17]],"date-time":"2021-01-17T00:00:00Z","timestamp":1610841600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"RFBR","award":["19-31-90053"],"award-info":[{"award-number":["19-31-90053"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,1,18]]},"DOI":"10.1145\/3441296.3441397","type":"proceedings-article","created":{"date-parts":[[2020,12,23]],"date-time":"2020-12-23T00:32:44Z","timestamp":1608683564000},"page":"58-73","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient fair conjunction for structurally-recursive relations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3563-2828","authenticated-orcid":false,"given":"Peter","family":"Lozov","sequence":"first","affiliation":[{"name":"St. Petersburg State University, Russia \/ JetBrains Research, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8363-7143","authenticated-orcid":false,"given":"Dmitry","family":"Boulytchev","sequence":"additional","affiliation":[{"name":"St. Petersburg State University, Russia \/ JetBrains Research, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Workshop on Scheme and Functional Programming ( 2011 ).","author":"Alvis Claire E.","unstructured":"Claire E. Alvis , Jeremiah J. Willcock , and William E. Byrd . 2011. cKanren: miniKanren with Constraints . Workshop on Scheme and Functional Programming ( 2011 ). Claire E. Alvis, Jeremiah J. Willcock, and William E. Byrd. 2011. cKanren: miniKanren with Constraints. Workshop on Scheme and Functional Programming ( 2011 )."},{"key":"e_1_3_2_1_2_1","volume-title":"Interactive Theorem Proving and Program Development-Coq'Art: The Calculus of Inductive Constructions","author":"Bertot Yves","unstructured":"Yves Bertot and Pierre Cast\u00e9ran . 2004. Interactive Theorem Proving and Program Development-Coq'Art: The Calculus of Inductive Constructions . Springer . htps:\/\/doi.org\/10.1007\/978-3-662-07964-5 10.1007\/978-3-662-07964-5 Yves Bertot and Pierre Cast\u00e9ran. 2004. Interactive Theorem Proving and Program Development-Coq'Art: The Calculus of Inductive Constructions. Springer. htps:\/\/doi.org\/10.1007\/978-3-662-07964-5"},{"key":"e_1_3_2_1_3_1","volume-title":"Interactive Theorem Proving and Program Development-Coq'Art: The Calculus of Inductive Constructions","author":"Bertot Yves","unstructured":"Yves Bertot and Pierre Cast\u00e9ran . 2004. Interactive Theorem Proving and Program Development-Coq'Art: The Calculus of Inductive Constructions . Springer . htps:\/\/doi.org\/10.1007\/978-3-662-07964-5 10.1007\/978-3-662-07964-5 Yves Bertot and Pierre Cast\u00e9ran. 2004. Interactive Theorem Proving and Program Development-Coq'Art: The Calculus of Inductive Constructions. Springer. htps:\/\/doi.org\/10.1007\/978-3-662-07964-5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110252"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 2007 Annual Workshop on Scheme and Functional Programming ( 2007 ), 79-90","author":"William","unstructured":"William E. Byrd and Daniel P. Friedman. 2007. kanren: A Fresh Name in Nominal Logic Programming . Proceedings of the 2007 Annual Workshop on Scheme and Functional Programming ( 2007 ), 79-90 . William E. Byrd and Daniel P. Friedman. 2007. kanren: A Fresh Name in Nominal Logic Programming. Proceedings of the 2007 Annual Workshop on Scheme and Functional Programming ( 2007 ), 79-90."},{"key":"e_1_3_2_1_7_1","volume-title":"Workshop on Scheme and Functional Programming ( 2012 ).","author":"Byrd William E.","unstructured":"William E. Byrd , Eric Holk , and Daniel P. Friedman . 2012. miniKanren, Live and Untagged: Quine Generation via Relational Interpreters (Programming Pearl) . Workshop on Scheme and Functional Programming ( 2012 ). William E. Byrd, Eric Holk, and Daniel P. Friedman. 2012. miniKanren, Live and Untagged: Quine Generation via Relational Interpreters (Programming Pearl). Workshop on Scheme and Functional Programming ( 2012 )."},{"key":"e_1_3_2_1_8_1","volume-title":"The Reasoned Schemer","author":"Friedman Daniel P.","unstructured":"Daniel P. Friedman , William E. Byrd , and Oleg Kiselyov . 2005. The Reasoned Schemer . The MIT Press . Daniel P. Friedman, William E. Byrd, and Oleg Kiselyov. 2005. The Reasoned Schemer. The MIT Press."},{"key":"e_1_3_2_1_9_1","volume-title":"Fancy Ferns Require Little Care. Symposium on Functional Languages and Computer Architecture ( 1981 ), 124-156","author":"Daniel","unstructured":"Daniel P. Friedman and David S. Wise. 1981 . Fancy Ferns Require Little Care. Symposium on Functional Languages and Computer Architecture ( 1981 ), 124-156 . Daniel P. Friedman and David S. Wise. 1981. Fancy Ferns Require Little Care. Symposium on Functional Languages and Computer Architecture ( 1981 ), 124-156."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/504083.504085"},{"key":"#cr-split#-e_1_3_2_1_11_1.1","doi-asserted-by":"crossref","unstructured":"Jason Hemann Daniel Friedman William Byrd and Matthew Might. 2016. A small embedding of logic programming with a simple complete search. (11 2016 ) 96-107. htps:\/\/doi.org\/10.1145\/2989225.2989230 10.1145\/2989225.2989230","DOI":"10.1145\/3093334.2989230"},{"key":"#cr-split#-e_1_3_2_1_11_1.2","doi-asserted-by":"crossref","unstructured":"Jason Hemann Daniel Friedman William Byrd and Matthew Might. 2016. A small embedding of logic programming with a simple complete search. (11 2016 ) 96-107. htps:\/\/doi.org\/10.1145\/2989225.2989230","DOI":"10.1145\/3093334.2989230"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 2013 Annual Workshop on Scheme and Functional Programming.","author":"Hemann Jason","unstructured":"Jason Hemann and Daniel P. Friedman . 2013. Kanren: A Minimal Functional Core for Relational Programming . In Proceedings of the 2013 Annual Workshop on Scheme and Functional Programming. Jason Hemann and Daniel P. Friedman. 2013. Kanren: A Minimal Functional Core for Relational Programming. In Proceedings of the 2013 Annual Workshop on Scheme and Functional Programming."},{"key":"#cr-split#-e_1_3_2_1_13_1.1","doi-asserted-by":"crossref","unstructured":"Robert M. Keller. 1976. Formal Verification of Parallel Programs. Commun. ACM 19 7 ( 1976 ) 371-384. htps:\/\/doi.org\/10.1145\/360248.360251 10.1145\/360248.360251","DOI":"10.1145\/360248.360251"},{"key":"#cr-split#-e_1_3_2_1_13_1.2","doi-asserted-by":"crossref","unstructured":"Robert M. Keller. 1976. Formal Verification of Parallel Programs. Commun. ACM 19 7 ( 1976 ) 371-384. htps:\/\/doi.org\/10.1145\/360248.360251","DOI":"10.1145\/360248.360251"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1090189.1086390"},{"key":"e_1_3_2_1_15_1","volume-title":"On the Power of Homeomorphic Embedding for Online Termination","author":"Leuschel Michael","unstructured":"Michael Leuschel . 1998. On the Power of Homeomorphic Embedding for Online Termination . In Static Analysis, Giorgio Levi (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 230-245. Michael Leuschel. 1998. On the Power of Homeomorphic Embedding for Online Termination. In Static Analysis, Giorgio Levi (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 230-245."},{"key":"e_1_3_2_1_16_1","volume-title":"Foundations of Logic Programming","author":"Lloyd John W.","unstructured":"John W. Lloyd . 1984. Foundations of Logic Programming , 1 st Edition. Springer . John W. Lloyd. 1984. Foundations of Logic Programming, 1st Edition. Springer.","edition":"1"},{"key":"e_1_3_2_1_17_1","volume-title":"Relational Interpreters for Search Problems. International Workshop on miniKanren and Relational Programming ( 2019 ).","author":"Lozov P.","year":"2019","unstructured":"P. Lozov , Ekaterina Verbitskaia , and Dmitry Boulytchev . 2019 . Relational Interpreters for Search Problems. International Workshop on miniKanren and Relational Programming ( 2019 ). P. Lozov, Ekaterina Verbitskaia, and Dmitry Boulytchev. 2019. Relational Interpreters for Search Problems. International Workshop on miniKanren and Relational Programming ( 2019 )."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Petr Lozov Andrei Vyatkin and Dmitry Boulytchev. 2018. Typed Relational Conversion. Trends in Functional Programming ( 2018 ) 39-58.  Petr Lozov Andrei Vyatkin and Dmitry Boulytchev. 2018. Typed Relational Conversion. Trends in Functional Programming ( 2018 ) 39-58.","DOI":"10.1007\/978-3-319-89719-6_3"},{"key":"e_1_3_2_1_19_1","volume-title":"Friedman","author":"Lu Kuang-Chen","year":"2019","unstructured":"Kuang-Chen Lu , Weixi Ma , and Daniel P . Friedman . 2019 . Towards a miniKanren with fair search strategies. The miniKanren and Relational Programming Workshop ( 2019 ). Kuang-Chen Lu, Weixi Ma, and Daniel P. Friedman. 2019. Towards a miniKanren with fair search strategies. The miniKanren and Relational Programming Workshop ( 2019 )."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"L. Naish. 1985. Automating Control for Logic Programs. J. Log. Program. 2 ( 1985 ) 167-183.  L. Naish. 1985. Automating Control for Logic Programs. J. Log. Program. 2 ( 1985 ) 167-183.","DOI":"10.1016\/0743-1066(85)90017-2"},{"key":"#cr-split#-e_1_3_2_1_21_1.1","unstructured":"Joseph Near William Byrd and Daniel Friedman. 2008. leanTAP: A Declarative Theorem Prover for First-Order Classical Logic. 5366 ( 12 2008 ) 238-252. htps:\/\/doi.org\/10.1007\/978-3-540-89982-2_26 10.1007\/978-3-540-89982-2_26"},{"key":"#cr-split#-e_1_3_2_1_21_1.2","doi-asserted-by":"crossref","unstructured":"Joseph Near William Byrd and Daniel Friedman. 2008. leanTAP: A Declarative Theorem Prover for First-Order Classical Logic. 5366 ( 12 2008 ) 238-252. htps:\/\/doi.org\/10.1007\/978-3-540-89982-2_26","DOI":"10.1007\/978-3-540-89982-2_26"},{"key":"#cr-split#-e_1_3_2_1_22_1.1","unstructured":"Dmitri Rozplokhas and Dmitri Boulytchev. 2018. Improving Refutational Completeness of Relational Search via Divergence Test. ( 2018 ) 18 : 1-18 : 13. htps:\/\/doi.org\/10.1145\/3236950.3236958 10.1145\/3236950.3236958"},{"key":"#cr-split#-e_1_3_2_1_22_1.2","doi-asserted-by":"crossref","unstructured":"Dmitri Rozplokhas and Dmitri Boulytchev. 2018. Improving Refutational Completeness of Relational Search via Divergence Test. ( 2018 ) 18 : 1-18 : 13. htps:\/\/doi.org\/10.1145\/3236950.3236958","DOI":"10.1145\/3236950.3236958"},{"key":"e_1_3_2_1_23_1","volume-title":"Programming Languages and Systems, Bruno C. d","author":"Rozplokhas Dmitry","unstructured":"Dmitry Rozplokhas , Andrey Vyatkin , and Dmitry Boulytchev . 2020. Certified Semantics for Relational Programming . In Programming Languages and Systems, Bruno C. d . S. Oliveira (Ed.). Springer International Publishing , Cham , 167-185. Dmitry Rozplokhas, Andrey Vyatkin, and Dmitry Boulytchev. 2020. Certified Semantics for Relational Programming. In Programming Languages and Systems, Bruno C. d. S. Oliveira (Ed.). Springer International Publishing, Cham, 167-185."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"T. Schrijvers Markus Triska and Bart Demoen. 2012. Tor: extensible search with hookable disjunction. In PPDP.  T. Schrijvers Markus Triska and Bart Demoen. 2012. Tor: extensible search with hookable disjunction. In PPDP.","DOI":"10.1145\/2370776.2370790"},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the 2013 Annual Workshop on Scheme and Functional Programming ( 2013 ).","author":"Swords Cameron","unstructured":"Cameron Swords and Daniel P. Friedman . 2013. rKanren: Guided Search in miniKanren . Proceedings of the 2013 Annual Workshop on Scheme and Functional Programming ( 2013 ). Cameron Swords and Daniel P. Friedman. 2013. rKanren: Guided Search in miniKanren. Proceedings of the 2013 Annual Workshop on Scheme and Functional Programming ( 2013 )."},{"key":"e_1_3_2_1_26_1","volume-title":"S\u00f8rensen and Robert Gl\u00fcck","author":"Morten","year":"1995","unstructured":"Morten H. S\u00f8rensen and Robert Gl\u00fcck . 1995 . An Algorithm of Generalization in Positive Supercompilation. In Proceedings of ILPS'95, the International Logic Programming Symposium. MIT Press , 465-479. Morten H. S\u00f8rensen and Robert Gl\u00fcck. 1995. An Algorithm of Generalization in Positive Supercompilation. In Proceedings of ILPS'95, the International Logic Programming Symposium. MIT Press, 465-479."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16492-8_66"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/5956.5957"}],"event":{"name":"POPL '21: The 48th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","location":"Virtual Denmark","acronym":"POPL '21","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2021 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3441296.3441397","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3441296.3441397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:03:04Z","timestamp":1750197784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3441296.3441397"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,17]]},"references-count":31,"alternative-id":["10.1145\/3441296.3441397","10.1145\/3441296"],"URL":"https:\/\/doi.org\/10.1145\/3441296.3441397","relation":{},"subject":[],"published":{"date-parts":[[2021,1,17]]},"assertion":[{"value":"2021-01-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}