{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T02:20:35Z","timestamp":1773886835125,"version":"3.50.1"},"reference-count":105,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:p>\n            Datalog is a popular logic programming language for deductive reasoning tasks in a wide array of applications, including business analytics, program analysis, and ontological reasoning. However, Datalog's restriction to flat facts over atomic constants leads to challenges in working with tree-structured data, such as derivation trees or abstract syntax trees. To ameliorate Datalog's restrictions, popular extensions of Datalog support features such as existential quantification in rule heads (Datalog*, Datalog\n            <jats:sup>\u2203<\/jats:sup>\n            ) or algebraic data types (Souffl\u00e9). Unfortunately, these are imperfect solutions for reasoning over structured and recursive data types, with general existentials leading to complex implementations requiring unification, and ADTs unable to trigger rule evaluation and failing to support efficient indexing.\n          <\/jats:p>\n          <jats:p>\n            We present\n            <jats:italic>D<\/jats:italic>\n            <jats:italic>L<\/jats:italic>\n            <jats:sup>\u2203!<\/jats:sup>\n            , a Datalog with first-class facts, wherein every fact is identified with a Skolem term unique to the fact. We show that this restriction offers an attractive price point for Datalogbased reasoning over tree-shaped data, demonstrating its application to databases, artificial intelligence, and programming languages. We implemented\n            <jats:italic>D<\/jats:italic>\n            <jats:italic>L<\/jats:italic>\n            <jats:sup>\u2203!<\/jats:sup>\n            as a system Slog, which leverages the uniqueness restriction of\n            <jats:italic>D<\/jats:italic>\n            <jats:italic>L<\/jats:italic>\n            <jats:sup>\u2203!<\/jats:sup>\n            to enable a communication-avoiding, massively-parallel implementation built on MPI. We show that Slog outperforms leading systems (Nemo, Vlog, RDFox, and Souffl\u00e9) on a variety of benchmarks, with the potential to scale to thousands of threads.\n          <\/jats:p>","DOI":"10.14778\/3712221.3712232","type":"journal-article","created":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T18:03:04Z","timestamp":1744048984000},"page":"651-665","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Datalog with First-Class Facts"],"prefix":"10.14778","volume":"18","author":[{"given":"Thomas","family":"Gilray","sequence":"first","affiliation":[{"name":"Washington State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arash","family":"Sahebolamri","sequence":"additional","affiliation":[{"name":"Syracuse University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihao","family":"Sun","sequence":"additional","affiliation":[{"name":"Syracuse University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sowmith","family":"Kunapaneni","sequence":"additional","affiliation":[{"name":"Washington State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sidharth","family":"Kumar","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristopher","family":"Micinski","sequence":"additional","affiliation":[{"name":"Syracuse University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,4,7]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Foundations of databases: the logical level","author":"Abiteboul Serge","unstructured":"Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of databases: the logical level. Addison-Wesley Longman Publishing Co., Inc."},{"key":"e_1_2_1_2_1","volume-title":"Michael Peyton Jones, and C.-H. Luke Ong","author":"Alvarez-Picallo Mario","year":"2019","unstructured":"Mario Alvarez-Picallo, Alex Eyers-Taylor, Michael Peyton Jones, and C.-H. Luke Ong. 2019. Fixing Incremental Computation. In Programming Languages and Systems, Lu\u00eds Caires (Ed.). Springer International Publishing, Cham, 525--552."},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the ACM on Programming Languages 2, POPL","author":"Amin Nada","year":"2017","unstructured":"Nada Amin and Tiark Rompf. 2017. Collapsing towers of interpreters. Proceedings of the ACM on Programming Languages 2, POPL (2017), 1--33."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3090163.3090168"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3088515.3088522"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742796"},{"key":"e_1_2_1_7_1","volume-title":"RuleML 2015, Berlin, Germany, August 2-5, 2015, Proceedings 9. Springer, 328--344","author":"Baget Jean-Fran\u00e7ois","year":"2015","unstructured":"Jean-Fran\u00e7ois Baget, Michel Lecl\u00e8re, Marie-Laure Mugnier, Swan Rocher, and Cl\u00e9ment Sipieter. 2015. Graal: A toolkit for query answering with existential rules. In Rule Technologies: Foundations, Tools, and Applications: 9th International Symposium, RuleML 2015, Berlin, Germany, August 2-5, 2015, Proceedings 9. Springer, 328--344."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.002"},{"key":"e_1_2_1_9_1","volume-title":"Reasoning over Financial Scenarios with the Vadalog System. In # PLACE-HOLDER_PARENT_METADATA_VALUE#","author":"Baldazzi Teodoro","unstructured":"Teodoro Baldazzi, Luigi Bellomarini, and Emanuel Sallinger. 2023. Reasoning over Financial Scenarios with the Vadalog System. In # PLACE-HOLDER_PARENT_METADATA_VALUE#, Vol. 26. OpenProceedings. org, 782--791."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565850"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565850"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976736"},{"key":"e_1_2_1_13_1","volume-title":"Modular Abstract Definitional Interpreters for WebAssembly. In European Conference on Object-Oriented Programming (ECOOP","author":"Brandl Katharina","year":"2023","unstructured":"Katharina Brandl, Sebastian Erdweg, Sven Keidel, and Nils Hansen. 2023. Modular Abstract Definitional Interpreters for WebAssembly. In European Conference on Object-Oriented Programming (ECOOP 2023)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640108"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.642949"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3587136.3587137"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44503-X_20"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3651146"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"38","author":"Calautti Marco","year":"2024","unstructured":"Marco Calautti, Ester Livshits, Andreas Pieris, and Markus Schneider. 2024. Computing the Why-Provenance for Datalog Queries via SAT Solvers. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 38. 10459--10466."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559809"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"David Carral Irina Dragoste and Markus Kr\u00f6tzsch. 2017. Restricted Chase (Non) Termination for Existential Rules with Disjunctions.. In IJCAI. 922--928.","DOI":"10.24963\/ijcai.2017\/128"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence","author":"Carral David","year":"2019","unstructured":"David Carral, Irina Dragoste, Markus Kr\u00f6tzsch, and Christian Lewe. 2019. Chasing sets: how to use existential rules for expressive reasoning. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (Macao, China) (IJCAI'19). AAAI Press, 1624--1631."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/128"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Stefano Ceri Georg Gottlob Letizia Tanca et al. 1989. What you always wanted to know about Datalog(and never dared to ask). IEEE transactions on knowledge and data engineering 1 1 (1989) 146--166.","DOI":"10.1109\/69.43410"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"James Cheney Laura Chiticariu Wang-Chiew Tan et al. 2009. Provenance in databases: Why how and where. Foundations and Trends\u00ae in Databases 1 4 (2009) 379--474.","DOI":"10.1561\/1900000006"},{"key":"e_1_2_1_26_1","volume-title":"Datomic: A Distributed Deductive Database in Clojure. https:\/\/www.datomic.com\/. accessed: 9-22-2024.","author":"Cognitect","unstructured":"Cognitect, Inc. [n.d.]. Datomic: A Distributed Deductive Database in Clojure. https:\/\/www.datomic.com\/. accessed: 9-22-2024."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/234528.234740"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567778"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of 16th International Conference on Data Engineering (Cat. No. 00CB37073)","author":"Cui Yingwei","year":"2000","unstructured":"Yingwei Cui and Jennifer Widom. 2000. Lineage tracing in a data warehousing system. In Proceedings of 16th International Conference on Data Engineering (Cat. No. 00CB37073). IEEE, 683--684."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/357775.357777"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the ACM on Programming Languages 1, ICFP","author":"Darais David","year":"2017","unstructured":"David Darais, Nicholas Labich, Ph\u00fac C Nguyen, and David Van Horn. 2017. Abstracting definitional interpreters (functional pearl). Proceedings of the ACM on Programming Languages 1, ICFP (2017), 1--25."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_2_1_34_1","volume-title":"International Joint Conference on Rules and Reasoning. Springer, 146--163","author":"Elhalawati Ali","year":"2022","unstructured":"Ali Elhalawati, Markus Kr\u00f6tzsch, and Stephan Mennicke. 2022. An existential rule framework for computing why-provenance on-demand for datalog. In International Joint Conference on Rules and Reasoning. Springer, 146--163."},{"key":"e_1_2_1_35_1","volume-title":"Neat explanation of proof trees","author":"Eriksson Agneta","unstructured":"Agneta Eriksson and Anna-Lena Johansson. 1985. Neat explanation of proof trees. Uppsala University, Computing Science Department, Uppsala Programming ...."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054115400018"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3502181.3531468"},{"key":"e_1_2_1_38_1","volume-title":"Scaling-up in-memory datalog processing: Observations and techniques. arXiv preprint arXiv:1812.03975","author":"Fan Zhiwei","year":"2018","unstructured":"Zhiwei Fan, Jianqiao Zhu, Zuyu Zhang, Aws Albarghouthi, Paraschos Koutris, and Jignesh Patel. 2018. Scaling-up in-memory datalog processing: Observations and techniques. arXiv preprint arXiv:1812.03975 (2018)."},{"key":"e_1_2_1_39_1","volume-title":"International Symposium on Explanation-Aware Computing, ExaCt","author":"Ferrand G\u00e9rard","year":"2005","unstructured":"G\u00e9rard Ferrand, Willy Lesaint, and Alexandre Tessier. 2005. Explanations and proof trees. In International Symposium on Explanation-Aware Computing, ExaCt 2005. AAAI Press, 76--85."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/898758"},{"key":"e_1_2_1_41_1","volume-title":"European Symposium on Programming. Springer, Cham, 197--223","author":"Germane Kimball","year":"2020","unstructured":"Kimball Germane and Michael D Adams. 2020. Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap. In European Symposium on Programming. Springer, Cham, 197--223."},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the ACM on Programming Languages 5, ICFP","author":"Germane Kimball","year":"2021","unstructured":"Kimball Germane and Jay McCarthy. 2021. Newly-single and loving it: improving higher-order must-alias analysis with heap fragments. Proceedings of the ACM on Programming Languages 5, ICFP (2021), 1--28."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951913.2951936"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2019.00014"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3446804.3446855"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837631"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265535"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3324959"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2594530"},{"key":"e_1_2_1_50_1","volume-title":"The semantics of programming languages: an elementary introduction using structural operational semantics","author":"Hennessy Matthew","unstructured":"Matthew Hennessy. 1990. The semantics of programming languages: an elementary introduction using structural operational semantics. John Wiley & Sons, Inc."},{"key":"e_1_2_1_51_1","volume-title":"Nemo: First glimpse of a new rule engine. arXiv preprint arXiv:2308.15897","author":"Ivliev Alex","year":"2023","unstructured":"Alex Ivliev, Stefan Ellmauthaler, Lukas Gerlach, Maximilian Marx, Matthias Mei\u00dfner, Simon Meusel, and Markus Kr\u00f6tzsch. 2023. Nemo: First glimpse of a new rule engine. arXiv preprint arXiv:2308.15897 (2023)."},{"key":"e_1_2_1_52_1","volume-title":"Computer Aided Verification: 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part II 28","author":"Jordan Herbert","year":"2016","unstructured":"Herbert Jordan, Bernhard Scholz, and Pavle Suboti\u0107. 2016. Souffl\u00e9: On synthesis of program analyzers. In Computer Aided Verification: 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part II 28, Swarat Chaudhuri and Azadeh Farzan (Eds.). Springer, Springer International Publishing, Cham, 422--430."},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the 10th International Workshop on Programming Models and Applications for Multicores and Manycores","author":"Jordan Herbert","year":"2019","unstructured":"Herbert Jordan, Pavle Suboti\u0107, David Zhao, and Bernhard Scholz. 2019. Brie: A specialized trie for concurrent datalog. In Proceedings of the 10th International Workshop on Programming Models and Applications for Multicores and Manycores (Washington, DC, USA) (PMAM'19). ACM, New York, NY, USA, 31--40."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295719"},{"key":"e_1_2_1_55_1","volume-title":"Annual symposium on theoretical aspects of computer science. Springer, 22--39","author":"Kahn Gilles","year":"1987","unstructured":"Gilles Kahn. 1987. Natural semantics. In Annual symposium on theoretical aspects of computer science. Springer, 22--39."},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10817-013-9296-3","article-title":"The Incredible ELK: From Polynomial Procedures to Efficient Reasoning with EL Ontologies","volume":"53","author":"Kazakov Yevgeny","year":"2014","unstructured":"Yevgeny Kazakov, Markus Kr\u00f6tzsch, and Franti\u0161ek Siman\u010d\u00edk. 2014. The Incredible ELK: From Polynomial Procedures to Efficient Reasoning with EL Ontologies. Journal of automated reasoning 53, 1 (2014), 1--61.","journal-title":"Journal of automated reasoning"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500618"},{"key":"e_1_2_1_58_1","volume-title":"A call-by-name lambda-calculus machine. Higher-order and symbolic computation 20, 3","author":"Krivine Jean-Louis","year":"2007","unstructured":"Jean-Louis Krivine. 2007. A call-by-name lambda-calculus machine. Higher-order and symbolic computation 20, 3 (2007), 199--207."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.3844\/jcssp.2017.781.794"},{"key":"e_1_2_1_60_1","volume-title":"2008 IEEE International Symposium on Parallel and Distributed Processing. 1--8.","author":"Kumar R.","unstructured":"R. Kumar, A. Mamidala, and D. K. Panda. 2008. Scaling alltoall collective on multi-core systems. In 2008 IEEE International Symposium on Parallel and Distributed Processing. 1--8."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07518-1_20"},{"key":"e_1_2_1_62_1","volume-title":"High Performance Computing: 35th International Conference, ISC High Performance 2020, Frankfurt\/Main, Germany, June 22--25, 2020, Proceedings 35","author":"Kumar Sidharth","year":"2020","unstructured":"Sidharth Kumar and Thomas Gilray. 2020. Load-balancing parallel relational algebra. In High Performance Computing: 35th International Conference, ISC High Performance 2020, Frankfurt\/Main, Germany, June 22--25, 2020, Proceedings 35. Springer, 288--308."},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/3031843.3031846"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320115"},{"key":"e_1_2_1_65_1","first-page":"11","article-title":"On the Meanings of the Logical Constants and the Justifications of the Logical Laws","volume":"1","author":"Martin-L\u00f6f Per","year":"1996","unstructured":"Per Martin-L\u00f6f. 1996. On the Meanings of the Logical Constants and the Justifications of the Logical Laws. Nordic Journal of Philosophical Logic 1, 1 (1996), 11--60.","journal-title":"Nordic Journal of Philosophical Logic"},{"key":"e_1_2_1_66_1","volume-title":"Rebecca Isaacs, and Michael Isard.","author":"McSherry Frank","year":"2013","unstructured":"Frank McSherry, Derek Gordon Murray, Rebecca Isaacs, and Michael Isard. 2013. Differential dataflow.. In CIDR."},{"key":"e_1_2_1_67_1","volume-title":"International Static Analysis Symposium (SAS '10)","author":"Might Matthew","year":"2010","unstructured":"Matthew Might. 2010. Abstract interpreters for free. In International Static Analysis Symposium (SAS '10). Springer, 407--421."},{"key":"e_1_2_1_68_1","volume-title":"International Workshop on Verification, Model Checking, and Abstract Interpretation. Springer, 260--274","author":"Might Matthew","year":"2009","unstructured":"Matthew Might and Panagiotis Manolios. 2009. A posteriori soundness for non-deterministic abstract interpretations. In International Workshop on Verification, Model Checking, and Abstract Interpretation. Springer, 260--274."},{"key":"e_1_2_1_69_1","first-page":"5","article-title":"Exploiting reachability and cardinality in higher-order flow analysis","volume":"18","author":"Might Matthew","year":"2008","unstructured":"Matthew Might and Olin Shivers. 2008. Exploiting reachability and cardinality in higher-order flow analysis. Journal of Functional Programming 18, 5-6 (2008), 821--864.","journal-title":"Journal of Functional Programming"},{"key":"e_1_2_1_70_1","volume-title":"Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation. 305--315","author":"Might Matthew","year":"2010","unstructured":"Matthew Might, Yannis Smaragdakis, and David Van Horn. 2010. Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis. In Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation. 305--315."},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2018.12.004"},{"key":"e_1_2_1_72_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"28","author":"Motik Boris","year":"2014","unstructured":"Boris Motik, Yavor Nenov, Robert Piro, Ian Horrocks, and Dan Olteanu. 2014. Parallel materialisation of datalog programs in centralised, main-memory RDF systems. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 28."},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522738"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25010-6_1"},{"key":"e_1_2_1_75_1","volume-title":"Proceedings of the ACM on Programming Languages 2, POPL","author":"Nguyen Phuc C","year":"2017","unstructured":"Phuc C Nguyen, Thomas Gilray, Sam Tobin-Hochstadt, and David Van Horn. 2017. Soft contract verification for higher-order stateful programs. Proceedings of the ACM on Programming Languages 2, POPL (2017), 51."},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357766.3359534"},{"key":"e_1_2_1_77_1","volume-title":"36th European Conference on Object-Oriented Programming (ECOOP","author":"Pacak Andr\u00e9","year":"2022","unstructured":"Andr\u00e9 Pacak and Sebastian Erdweg. 2022. Functional programming with Data-log. In 36th European Conference on Object-Oriented Programming (ECOOP 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428195"},{"key":"e_1_2_1_80_1","volume-title":"Types and Programming Languages","author":"Pierce Benjamin C.","unstructured":"Benjamin C. Pierce. 2002. Types and Programming Languages (1st ed.). The MIT Press.","edition":"1"},{"key":"e_1_2_1_81_1","volume-title":"Advanced Topics in Types and Programming Languages","author":"Pierce Benjamin C.","unstructured":"Benjamin C. Pierce. 2004. Advanced Topics in Types and Programming Languages. The MIT Press."},{"key":"e_1_2_1_82_1","volume-title":"Structural operational semantics","author":"Plotkin Gordon D","year":"1981","unstructured":"Gordon D Plotkin. 1981. Structural operational semantics. Aarhus University, Denmark (1981), 20--23."},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.07.286"},{"key":"e_1_2_1_84_1","volume-title":"Proceedings of the ACM annual conference-Volume 2. 717--740","author":"Reynolds John C","year":"1972","unstructured":"John C Reynolds. 1972. Definitional interpreters for higher-order programming languages. In Proceedings of the ACM annual conference-Volume 2. 717--740."},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/3622840"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/DMCC.1991.633174"},{"key":"e_1_2_1_87_1","volume-title":"2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, 278--289","author":"Seo Jiwon","year":"2013","unstructured":"Jiwon Seo, Stephen Guo, and Monica S Lam. 2013. SociaLite: Datalog extensions for efficient social network analysis. In 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, 278--289."},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556572"},{"key":"e_1_2_1_89_1","volume-title":"Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation. 399--410","author":"Sergey Ilya","year":"2013","unstructured":"Ilya Sergey, Dominique Devriese, Matthew Might, Jan Midtgaard, David Darais, Dave Clarke, and Frank Piessens. 2013. Monadic abstract interpreters. In Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation. 399--410."},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915229"},{"key":"e_1_2_1_92_1","volume-title":"Thomas Gilray, Kristopher Micinski, and Sidharth Kumar.","author":"Sun Yihao","year":"2023","unstructured":"Yihao Sun, Ahmedur Rahman Shovon, Thomas Gilray, Kristopher Micinski, and Sidharth Kumar. 2023. GDlog: A GPU-Accelerated Deductive Engine. arXiv:2311.02206 [cs.DB]"},{"key":"e_1_2_1_93_1","series-title":"SIAM journal on computing 1, 2","volume-title":"Depth-first search and linear graph algorithms","author":"Tarjan Robert","year":"1972","unstructured":"Robert Tarjan. 1972. Depth-first search and linear graph algorithms. SIAM journal on computing 1, 2 (1972), 146--160."},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.285"},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342005051521"},{"key":"e_1_2_1_96_1","volume-title":"Proceedings of the ACM international conference on Object oriented programming systems languages and applications. 537--554","author":"Tobin-Hochstadt Sam","year":"2012","unstructured":"Sam Tobin-Hochstadt and David Van Horn. 2012. Higher-order symbolic execution via contracts. In Proceedings of the ACM international conference on Object oriented programming systems languages and applications. 537--554."},{"key":"e_1_2_1_97_1","volume-title":"Proceedings of the 28th ACM international conference on Supercomputing. 135--144","author":"Tr\u00e4ff Jesper Larsson","year":"2014","unstructured":"Jesper Larsson Tr\u00e4ff, Antoine Rougier, and Sascha Hunold. 2014. Implementing a classic: Zero-copy all-to-all communication with MPI datatypes. In Proceedings of the 28th ACM international conference on Supercomputing. 135--144."},{"key":"e_1_2_1_98_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"30","author":"Urbani Jacopo","year":"2016","unstructured":"Jacopo Urbani, Ceriel Jacobs, and Markus Kr\u00f6tzsch. 2016. Column-oriented datalog materialization for large knowledge graphs. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 30."},{"key":"e_1_2_1_99_1","first-page":"1","article-title":"Parallel Evaluation of the Transitive Closure of a Database","volume":"17","author":"Valduriez Patrick","year":"1988","unstructured":"Patrick Valduriez and Setrag Khoshafian. 1988. Parallel Evaluation of the Transitive Closure of a Database Relation. Int. J. Parallel Program. 17, 1 (Feb. 1988), 19--42.","journal-title":"Relation. Int. J. Parallel Program."},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863553"},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037744"},{"key":"e_1_2_1_102_1","volume-title":"Proceedings of the ACM on Programming Languages 3, OOPSLA","author":"Wei Guannan","year":"2019","unstructured":"Guannan Wei, Yuxuan Chen, and Tiark Rompf. 2019. Staged abstract interpreters: Fast and modular whole-program analysis via meta-programming. Proceedings of the ACM on Programming Languages 3, OOPSLA (2019), 1--32."},{"key":"e_1_2_1_103_1","volume-title":"Proceedings of the ACM on Programming Languages 2, ICFP","author":"Wei Guannan","year":"2018","unstructured":"Guannan Wei, James Decker, and Tiark Rompf. 2018. Refunctionalization of abstract abstract machines: bridging the gap between abstract abstract machines and abstract definitional interpreters (functional pearl). Proceedings of the ACM on Programming Languages 2, ICFP (2018), 1--28."},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1145\/3434304"},{"key":"e_1_2_1_105_1","volume-title":"Logically Parallel Communication for Fast MPI+ Threads Applications","author":"Zambre Rohit","year":"2021","unstructured":"Rohit Zambre, Damodar Sahasrabudhe, Hui Zhou, Martin Berzins, Aparna Chandramowlishwaran, and Pavan Balaji. 2021. Logically Parallel Communication for Fast MPI+ Threads Applications. IEEE Transactions on Parallel and Distributed Systems (2021)."},{"key":"e_1_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498696"},{"key":"e_1_2_1_107_1","volume-title":"Kaleido: An Efficient Out-of-core Graph Mining System on A Single Machine. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). 673--684","author":"Zhao C.","unstructured":"C. Zhao, Z. Zhang, P. Xu, T. Zheng, and J. Guo. 2020. Kaleido: An Efficient Out-of-core Graph Mining System on A Single Machine. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). 673--684."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3712221.3712232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T18:44:07Z","timestamp":1744051447000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3712221.3712232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":105,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["10.14778\/3712221.3712232"],"URL":"https:\/\/doi.org\/10.14778\/3712221.3712232","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2024,11]]},"assertion":[{"value":"2025-04-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}