Yael Amsterdamer, Daniel Deutch & Val Tannen (2011):
Provenance for aggregate queries.
In: Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems,
pp. 153–164,
doi:10.1145/1989284.1989302.
Jacques Carette (2004):
Understanding Expression Simplification.
In: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation,
ISSAC '04.
ACM,
pp. 7279,
doi:10.1145/1005285.1005298.
Jacques Carette, Alan P. Sexton, Volker Sorge & Stephen M. Watt (2010):
Symbolic Domain Decomposition.
In: Serge Autexier, Jacques Calmet, David Delahaye, Patrick D. F. Ion, Laurence Rideau, Renaud Rioboo & Alan P. Sexton: Intelligent Computer Mathematics.
Springer,
pp. 172–188,
doi:10.2307/1968168.
Nilesh Dalvi & Dan Suciu (2007):
Efficient Query Evaluation on Probabilistic Databases.
The VLDB Journal 16(4),
pp. 523–544,
doi:10.1007/s00778-006-0004-3.
Jörg Flum, Markus Frick & Martin Grohe (2002):
Query Evaluation via Tree-Decompositions.
J. ACM 49(6),
pp. 716–752,
doi:10.1145/602220.602222.
Jeremy Gibbons, Fritz Henglein, Ralf Hinze & Nicolas Wu (2018):
Relational algebra by way of adjunctions.
Proceedings of the ACM on Programming Languages: International Conference onf Functional Programming (ICFP) 2(ICFP),
pp. 86,
doi:10.1145/3235035.
Goetz Graefe (1993):
Query Evaluation Techniques for Large Databases.
ACM Comput. Surv. 25(2),
pp. 73–169,
doi:10.1145/152610.152611.
Todd J. Green, Grigoris Karvounarakis & Val Tannen (2007):
Provenance Semirings.
In: Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems,
PODS '07.
Association for Computing Machinery,
New York, NY, USA,
pp. 31–40,
doi:10.1145/1265530.1265535.
Martin Grohe & Dániel Marx (2014):
Constraint Solving via Fractional Edge Covers.
ACM Trans. Algorithms 11(1),
doi:10.1145/2636918.
Fritz Henglein & Ralf Hinze (2013):
Distributive Sorting and Searching: From Generic Discrimination to Generic Tries.
In: Chung-chieh Shan: Proc. 11th Asian Symposium on Programming Languages and Systems (APLAS),
Lecture Notes in Computer Science (LNCS) 8301.
Springer,
pp. 315–332,
doi:10.1007/978-3-319-03542-0_23.
Troels Henriksen, Niels G. W. Serup, Martin Elsman, Fritz Henglein & Cosmin E. Oancea (2017):
Futhark: Purely Functional GPU-programming with Nested Parallelism and In-place Array Updates.
In: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation,
PLDI 2017.
ACM,
pp. 556–571,
doi:10.1145/1806596.1806606.
Ralf Hinze (2000):
Generalizing generalized tries.
Journal of Functional Programming 10(4),
pp. 327–351,
doi:10.1017/S0956796800003713.
Oleg Kiselyov (2018):
Reconciling abstraction with high performance: A metaocaml approach.
Foundations and Trends in Programming Languages 5(1),
pp. 1–101,
doi:10.1561/2500000038_supp.
Daniel Loeb (1992):
Sets with a negative number of elements.
Advances in Mathematics 91(1),
pp. 64–74,
doi:10.1016/0001-8708(92)90011-9.
H.D. Macedo & J.N. Oliveira (2012):
Typing linear algebra: A biproduct-oriented approach.
Science of Computer Programming.
David Maier, Yehoshua Sagiv & Mihalis Yannakakis (1981):
On the complexity of testing implications of functional and join dependencies.
Journal of the ACM (JACM) 28(4),
pp. 680–695,
doi:10.1145/322261.322263.
H.Q. Ngo, E. Porat, C. Ré & A. Rudra (2012):
Worst-case optimal join algorithms.
In: Proceedings of the 31st symposium on Principles of Database Systems.
ACM,
pp. 37–48.
Hung Q Ngo, Ely Porat, Christopher Ré & Atri Rudra (2018):
Worst-case optimal join algorithms.
Journal of the ACM (JACM) 65(3),
pp. 1–40,
doi:10.5555/795662.796318.
J. Oliveira (2012):
Typed Linear Algebra for Weighted (Probabilistic) Automata.
Implementation and Application of Automata,
pp. 52–65,
doi:10.1007/978-3-642-13321-3_16.
J.N. Oliveira (2012):
Towards a linear algebra of programming.
Formal Aspects of Computing 24(4),
pp. 433–458,
doi:10.1016/j.fss.2008.12.008.
José Nuno Oliveira & Hugo Daniel Macedo (2017):
The data cube as a typed linear algebra operator.
In: Proceedings of The 16th International Symposium on Database Programming Languages,
pp. 1–11,
doi:10.1145/99370.99404.
Anna Pagh & Rasmus Pagh (2006):
Scalable computation of acyclic joins.
Journal of the ACM,
doi:10.1145/1142351.1142384.
Matija Pretnar (2015):
An Introduction to Algebraic Effects and Handlers. Invited tutorial paper.
In: The 31st Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXI),
Electronic Notes in Theoretical Computer Science 319,
pp. 19–35.
Sven-Bodo Scholz (1994):
Single-assignment C — Functional Programming Using Imperative Style.
In: 6th International Workshop on Implementation of Functional Languages (IFL'94), Norwich, England, UK.
University of East Anglia, Norwich, England, UK,
pp. 211–2113.
Amir Shaikhha, Mathieu Huot, Jaclyn Smith & Dan Olteanu (2021):
Functional Collection Programming with Semi-Ring Dictionaries.
arXiv preprint arXiv:2103.06376.
Amir Shaikhha & Lionel Parreaux (2019):
Finally, a Polymorphic Linear Algebra Language (Pearl).
In: 33rd European Conference on Object-Oriented Programming (ECOOP 2019).
Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
Moshe Vardi (1982):
The Complexity of Relational Query Languages (Extended Abstract),
pp. 137–146,
doi:10.1145/800070.802186.
Dan E. Willard (2002):
An Algorithm for Handling Many Relational Calculus Queries Efficiently.
Journal of Computer and System Sciences 65(2),
pp. 295 – 331,
doi:10.1006/jcss.2002.1848.
Robert Wisbauer (1991):
Foundations of module and ring theory 3.
CRC Press.
eptcs@eptcs.org