Allouche, David, Simon de Givry, George Katsirelos, Thomas Schiex, and Matthias Zytnicki. 2015. “Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP.” In “Principles and Practice of Constraint Programming, CP 2015.” Special issue, Principles and Practice of Constraint Programming, CP 2015, Lecture Notes in Computer Science, vol. 9255 : 12–29. https://doi.org/10.1007/978-3-319-23219-5\_2.

Angiuli, Carlo, Edward Morehouse, Daniel R. Licata, and Robert Harper. 2014. “Homotopical Patch Theory.” In “Proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming, ICFP 2014.” Special issue, Proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming, ICFP 2014, 243–56. https://doi.org/10.1145/2692915.2628158.

Bancilhon, F., and N. Spyratos. 1981. “Update Semantics of Relational Views.” ACM Transactions on Database Systems 6 (4): 557–75. https://doi.org/10.1145/319628.319634.

Begoli, Edmon, Jesús Camacho-Rodr\́iguez, Julian Hyde, Michael J. Mior, and Daniel Lemire. 2018. “Apache Calcite: A Foundational Framework for Optimized Query Processing over Heterogeneous Data Sources.” In “Proceedings of the 2018 ACM SIGMOD International Conference on Management of Data (SIGMOD 2018).” Special issue, Proceedings of the 2018 ACM SIGMOD International Conference on Management of Data (SIGMOD 2018), 221–30. https://doi.org/10.1145/3183713.3190662.

Bistarelli, Stefano, Ugo Montanari, and Francesca Rossi. 1997. “Semiring-Based Constraint Satisfaction and Optimization.” Journal of the ACM 44 (2): 201–36. https://doi.org/10.1145/256303.256306.

Bohannon, Aaron, Benjamin C. Pierce, and Jeffrey A. Vaughan. 2006. “Relational Lenses: A Language for Updatable Views.” In Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 2006, edited by Stijn Vansummeren, Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 2006. ACM. https://doi.org/10.1145/1142351.1142399.

Bohannon, Aaron, J. Nathan Foster, Benjamin C. Pierce, Alexandre Pilkiewicz, and Alan Schmitt. 2008. “Boomerang: Resourceful Lenses for String Data.” In “Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008.” Special issue, Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, 407–19. https://doi.org/10.1145/1328438.1328487.

Brunsfeld, Max. 2018. “Tree-Sitter: A New Parsing System for Programming Tools.”. https://www.thestrangeloop.com/2018/tree-sitter%E2%80%94a-new-parsing-system-for-programming-tools.html.

Burstall, Rod M., and Joseph A. Goguen. 1977. “Putting Theories Together to Make Specifications.” In “Proceedings of the 5th International Joint Conference on Artificial Intelligence (IJCAI 1977).” Special issue, Proceedings of the 5th International Joint Conference on Artificial Intelligence (IJCAI 1977), 1045–58. https://www.ijcai.org/Proceedings/77-2/Papers/095.pdf.

Burstall, Rod M., and Joseph A. Goguen. 1980. “The Semantics of Clear, A Specification Language.” In “Abstract Software Specifications, 1979 Copenhagen Winter School.” Special issue, Abstract Software Specifications, 1979 Copenhagen Winter School, Lecture Notes in Computer Science, vol. 86 : 292–332. https://doi.org/10.1007/3-540-10007-5_41.

Cartmell, John. 1978. “Generalised Algebraic Theories and Contextual Categories.” D.Phil. thesis. https://ncatlab.org/nlab/files/Cartmell-Thesis.pdf.

Cartmell, John. 1986. “Generalised Algebraic Theories and Contextual Categories.” Annals of Pure and Applied Logic 32 : 209–43. https://doi.org/10.1016/0168-0072(86)90053-9.

Chacon, Scott, and Ben Straub. 2014. Pro Git. 2nd ed. Apress. https://doi.org/10.1007/978-1-4842-0076-6.

Clarke, Bryce, Derek Elkins, Jeremy Gibbons, et al. 2024. “Profunctor Optics, A Categorical Update.” Compositionality 6 : 1. https://doi.org/10.32408/compositionality-6-1.

Cooper, M. C., S. de Givry, M. Sanchez, T. Schiex, M. Zytnicki, and T. Werner. 2010. “Soft Arc Consistency Revisited.” Artificial Intelligence 174 (7–8): 449–78. https://doi.org/10.1016/j.artint.2010.02.001.

Cooper, Martin, and Thomas Schiex. 2004. “Arc Consistency for Soft Constraints.” Artificial Intelligence 154 (1–2): 199–227. https://doi.org/10.1016/j.artint.2003.09.002.

Curino, Carlo A., Hyun J. Moon, and Carlo Zaniolo. 2008. “Graceful Database Schema Evolution: The PRISM Workbench.” Proceedings of the VLDB Endowment 1 (1): 761–72. https://doi.org/10.14778/1453856.1453939.

Dechter, Rina. 1999. “Bucket Elimination: A Unifying Framework for Reasoning.” Artificial Intelligence 113 (1–2): 41–85. https://doi.org/10.1016/S0004-3702(99)00059-4.

Dechter, Rina, and Judea Pearl. 1987. “Network-Based Heuristics for Constraint-Satisfaction Problems.” Artificial Intelligence 34 (1): 1–38. https://doi.org/10.1016/0004-3702(87)90002-6.

Dempster, A. P. 1967. “Upper and Lower Probabilities Induced by a Multivalued Mapping.” The Annals of Mathematical Statistics 38 (2): 325–39. https://doi.org/10.1214/aoms/1177698950.

Diskin, Zinovy, Yingfei Xiong, and Krzysztof Czarnecki. 2011. “From State- to Delta-Based Bidirectional Model Transformations: The Asymmetric Case.” Journal of Object Technology 10 : 6:1–25. https://doi.org/10.5381/jot.2011.10.1.a6.

Do, Hong-Hai, and Erhard Rahm. 2002. “COMA—a System for Flexible Combination of Schema Matching Approaches.” In “Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002).” Special issue, Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002), 610–21. https://www.vldb.org/conf/2002/S17P03.pdf.

Dybjer, Peter. 1996. “Internal Type Theory.” In Types for Proofs and Programs, TYPES 1995, edited by Stefano Berardi and Mario Coppo, vol. 1158 of Types for Proofs and Programs, TYPES 1995. Lecture Notes in Computer Science. Springer. https://doi.org/10.1007/3-540-61780-9\_66.

Eilenberg, Samuel, and Saunders Mac Lane. 1945. “General Theory of Natural Equivalences.” Transactions of the American Mathematical Society 58 : 231–94. https://doi.org/10.2307/1990284.

Fagin, Ronald, Phokion G. Kolaitis, and Lucian Popa. 2005. “Data Exchange: Getting to the Core.” ACM Transactions on Database Systems 30 (1): 174–210. https://doi.org/10.1145/1061318.1061323.

Fagin, Ronald, Phokion G. Kolaitis, Lucian Popa, and Wang-Chiew Tan. 2005. “Composing Schema Mappings: Second-Order Dependencies to the Rescue.” ACM Transactions on Database Systems 30 (4): 994–1055. https://doi.org/10.1145/1114244.1114249.

Faria, Daniel, Catia Pesquita, Emanuel Santos, Matteo Palmonari, Isabel F. Cruz, and Francisco M. Couto. 2013. “The AgreementMakerLight Ontology Matching System.” In “On the Move to Meaningful Internet Systems: OTM 2013 Conferences.” Special issue, On the Move to Meaningful Internet Systems: OTM 2013 Conferences, Lecture Notes in Computer Science, vol. 8185 : 527–41. https://doi.org/10.1007/978-3-642-41030-7\_38.

Feder, Tomás, and Moshe Y. Vardi. 1998. “The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study Through Datalog and Group Theory.” SIAM Journal on Computing 28 (1): 57–104. https://doi.org/10.1137/S0097539794266766.

Foster, J. Nathan, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, and Alan Schmitt. 2007. “Combinators for Bidirectional Tree Transformations: A Linguistic Approach to the View-Update Problem.” ACM Transactions on Programming Languages and Systems 29 (3): 17. https://doi.org/10.1145/1232420.1232424.

Foster, J. Nathan, Alexandre Pilkiewicz, and Benjamin C. Pierce. 2008. “Quotient Lenses.” In “Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming, ICFP 2008.” Special issue, Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming, ICFP 2008, 383–96. https://doi.org/10.1145/1411204.1411257.

Freuder, Eugene C. 1982. “A Sufficient Condition for Backtrack-Free Search.” Journal of the ACM 29 (1): 24–32. https://doi.org/10.1145/322290.322292.

Goguen, Joseph A., and Rod M. Burstall. 1992. “Institutions: Abstract Model Theory for Specification and Programming.” Journal of the ACM 39 (1): 95–146. https://doi.org/10.1145/147508.147524.

Grohe, Martin. 2007. “The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side.” Journal of the ACM 54 (1): 1:1–24. https://doi.org/10.1145/1206035.1206036.

Hofmann, Martin, Benjamin C. Pierce, and Daniel Wagner. 2011. “Symmetric Lenses.” In Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, edited by Thomas Ball and Mooly Sagiv, Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011. ACM. https://doi.org/10.1145/1926385.1926428.

Hofmann, Martin, Benjamin C. Pierce, and Daniel Wagner. 2012. “Edit Lenses.” In “Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012.” Special issue, Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, 495–508. https://doi.org/10.1145/2103656.2103715.

Johnson, Michael, and Robert Rosebrugh. 2014. “Spans of Lenses.” In “Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference.” Special issue, Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference, CEUR Workshop Proceedings, vol. 1133 : 112–18. https://ceur-ws.org/Vol-1133/paper-18.pdf.

Johnson, Michael, Robert Rosebrugh, and R. J. Wood. 2012. “Lenses, Fibrations and Universal Translations.” Mathematical Structures in Computer Science 22 (1): 25–42. https://doi.org/10.1017/S0960129511000442.

Larrosa, Javier. 2002. “Node and Arc Consistency in Weighted CSP.” In “Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI 2002).” Special issue, Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI 2002), 48–53. https://cdn.aaai.org/AAAI/2002/AAAI02-008.pdf.

Larrosa, Javier, and Thomas Schiex. 2004. “Solving Weighted CSP by Maintaining Arc Consistency.” Artificial Intelligence 159 (1–2): 1–26. https://doi.org/10.1016/j.artint.2004.05.004.

Lee, J. H. M., and K. L. Leung. 2012. “Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint Satisfaction.” Journal of Artificial Intelligence Research 43 : 257–92. https://doi.org/10.1613/jair.3476.

Litt, Geoffrey, Peter van Hardenberg, and Orion Henry. 2020. “Project Cambria: Translate Your Data with Lenses.”. https://www.inkandswitch.com/cambria/.

Litt, Geoffrey, Peter van Hardenberg, and Orion Henry. 2021. “Cambria: Schema Evolution in Distributed Systems with Edit Lenses.” In “Proceedings of the 8th Workshop on Principles and Practice of Consistency for Distributed Data (PaPoC 2021).” Special issue, Proceedings of the 8th Workshop on Principles and Practice of Consistency for Distributed Data (PaPoC 2021), 1–9. https://doi.org/10.1145/3447865.3457963.

Lu, Jiaheng. 2025. “A Categorical Unification for Multi-Model Data: Part I Categorical Model and Normal Forms.”. https://arxiv.org/abs/2502.19131.

Lutterkort, David. 2008. “AUGEAS—a Configuration API.” In “Proceedings of the Linux Symposium.” Special issue, Proceedings of the Linux Symposium 2 : 47–56. https://www.kernel.org/doc/ols/2008/ols2008v2-pages-47-56.pdf.

McCreesh, Ciaran, and Patrick Prosser. 2015. “A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs.” In “Principles and Practice of Constraint Programming, CP 2015.” Special issue, Principles and Practice of Constraint Programming, CP 2015, Lecture Notes in Computer Science, vol. 9255 : 295–312. https://doi.org/10.1007/978-3-319-23219-5\_21.

McCreesh, Ciaran, Samba Ndojh Ndiaye, Patrick Prosser, and Christine Solnon. 2016. “Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems.” In “Principles and Practice of Constraint Programming (CP 2016).” Special issue, Principles and Practice of Constraint Programming (CP 2016), Lecture Notes in Computer Science, vol. 9892 : 350–68. https://doi.org/10.1007/978-3-319-44953-1_23.

McCreesh, Ciaran, Patrick Prosser, and James Trimble. 2017. “A Partitioning Algorithm for Maximum Common Subgraph Problems.” In “Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017).” Special issue, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), 712–19. https://doi.org/10.24963/ijcai.2017/99.

Meilicke, Christian, and Heiner Stuckenschmidt. 2007. “Analyzing Mapping Extraction Approaches.” In “Proceedings of the 2nd International Workshop on Ontology Matching (OM 2007), Collocated with ISWC 2007.” Special issue, Proceedings of the 2nd International Workshop on Ontology Matching (OM 2007), Collocated with ISWC 2007, CEUR Workshop Proceedings, vol. 304 : 25–36. https://ceur-ws.org/Vol-304/paper3.pdf.

Merkle, Ralph C. 1988. “A Digital Signature Based on a Conventional Encryption Function.” In Advances in Cryptology: CRYPTO 1987, edited by Carl Pomerance, vol. 293 of Advances in Cryptology: CRYPTO 1987. Lecture Notes in Computer Science. Springer. https://doi.org/10.1007/3-540-48184-2\_32.

Mimram, Samuel, and Cinzia Di Giusto. 2013. “A Categorical Theory of Patches.” Electronic Notes in Theoretical Computer Science 298 : 283–307. https://doi.org/10.1016/j.entcs.2013.09.018.

Pacheco, Hugo, and Alcino Cunha. 2011. “Calculating with Lenses: Optimising Bidirectional Transformations.” In “Proceedings of the 20th ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2011.” Special issue, Proceedings of the 20th ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2011, 91–100. https://doi.org/10.1145/1929501.1929520.

Pacheco, Hugo, Alcino Cunha, and Zhenjiang Hu. 2012. “Delta Lenses over Inductive Types.” Electronic Communications of the EASST 49. https://doi.org/10.14279/tuj.eceasst.49.713.

Patterson, Evan, Owen Lynch, and James Fairbanks. 2022. “Categorical Data Structures for Technical Computing.” Compositionality 4 (5). https://doi.org/10.32408/compositionality-4-5.

Pickering, Matthew, Jeremy Gibbons, and Nicolas Wu. 2017. “Profunctor Optics: Modular Data Accessors.” The Art, Science, And Engineering of Programming 1 (2): 7. https://doi.org/10.22152/programming-journal.org/2017/1/7.

Plotkin, Gordon D. 1975. “Call-by-Name, Call-by-Value and the \lambda-Calculus”. Theoretical Computer Science 1 (2): 125–59. https://doi.org/10.1016/0304-3975(75)90017-1.

Pombrio, Justin, and Shriram Krishnamurthi. 2014. “Resugaring: Lifting Evaluation Sequences Through Syntactic Sugar.” In “Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2014.” Special issue, Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2014, 361–71. https://doi.org/10.1145/2594291.2594319.

Roundy, David. 2005. “Darcs: Distributed Version Management in Haskell.” In “Proceedings of the 2005 ACM SIGPLAN Workshop on Haskell (Haskell '05).” Special issue, Proceedings of the 2005 ACM SIGPLAN Workshop on Haskell (Haskell '05), 1–4. https://doi.org/10.1145/1088348.1088349.

Régin, Jean-Charles. 1994. “A Filtering Algorithm for Constraints of Difference in CSPs.” In “Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994).” Special issue, Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994), 362–67. https://cdn.aaai.org/AAAI/1994/AAAI94-055.pdf.

Sannella, Donald, and Andrzej Tarlecki. 2012. Foundations of Algebraic Specification and Formal Software Development. Monographs in Theoretical Computer Science. An EATCS Series. Springer. https://doi.org/10.1007/978-3-642-17336-3.

Schiex, Thomas, Hélène Fargier, and Gérard Verfaillie. 1995. “Valued Constraint Satisfaction Problems: Hard and Easy Problems.” In “Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995).” Special issue, Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), 631–37. https://www.ijcai.org/Proceedings/95-1/Papers/083.pdf.

Schultz, Patrick, and Ryan Wisnesky. 2017. “Algebraic Data Integration.” Journal of Functional Programming 27 : e24. https://doi.org/10.1017/S0956796817000168.

Schultz, Patrick, David I. Spivak, Christina Vasilakopoulou, and Ryan Wisnesky. 2017. “Algebraic Databases.” Theory and Applications of Categories 32 (16): 547–619. http://tac.mta.ca/tac/volumes/32/16/32-16.pdf.

Shapiro, Marc, Nuno Preguiça, Carlos Baquero, and Marek Zawirski. 2011. “Conflict-Free Replicated Data Types.” In “Stabilization, Safety, And Security of Distributed Systems (SSS 2011).” Special issue, Stabilization, Safety, And Security of Distributed Systems (SSS 2011), Lecture Notes in Computer Science, vol. 6976 : 386–400. https://doi.org/10.1007/978-3-642-24550-3_29.

Spivak, David I., and Robert E. Kent. 2012. “Ologs: A Categorical Framework for Knowledge Representation.” PLOS ONE 7 (1): e24274. https://doi.org/10.1371/journal.pone.0024274.

Spivak, David I. 2012. “Functorial Data Migration.” Information and Computation 217 : 31–51. https://doi.org/10.1016/j.ic.2012.05.001.

Spivak, David I., and Ryan Wisnesky. 2015. “Relational Foundations for Functorial Data Migration.” In Proceedings of the 15th Symposium on Database Programming Languages, DBPL 2015, edited by James Cheney and Thomas Neumann, Proceedings of the 15th Symposium on Database Programming Languages, DBPL 2015. ACM. https://doi.org/10.1145/2815072.2815075.

Vertechi, Pietro. 2023. “Dependent Optics.” In Proceedings of the 5th International Conference on Applied Category Theory (ACT 2022), edited by Jade Master and Martha Lewis, vol. 380 of Proceedings of the 5th International Conference on Applied Category Theory (ACT 2022). EPTCS. https://doi.org/10.4204/EPTCS.380.8.

Zhu, Zirun, Hsiang-Shang Ko, Pedro Martins, João Saraiva, and Zhenjiang Hu. 2015. “BiYacc: Roll Your Parser and Reflective Printer into One.” In Proceedings of the 4th International Workshop on Bidirectional Transformations, Bx 2015, edited by Alcino Cunha and Ekkart Kindler, vol. 1396 of Proceedings of the 4th International Workshop on Bidirectional Transformations, Bx 2015. CEUR Workshop Proceedings. https://ceur-ws.org/Vol-1396/p43-zhu.pdf.

Jonge, Maartje de, and Eelco Visser. 2012. “An Algorithm for Layout Preservation in Refactoring Transformations.” In Software Language Engineering, SLE 2011, edited by Anthony Sloane and Uwe Aßmann, vol. 6940 of Software Language Engineering, SLE 2011. Lecture Notes in Computer Science. Springer. https://doi.org/10.1007/978-3-642-28830-2_3.

Givry, Simon de, Federico Heras, Matthias Zytnicki, and Javier Larrosa. 2005. “Existential Arc Consistency: Getting Closer to Full Arc Consistency in Weighted CSPs.” In “Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005).” Special issue, Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), 84–89. https://www.ijcai.org/Proceedings/05/Papers/0827.pdf.