Add abstract (#10)

* Add main paper to BibTeX

* Fix bibliography

* Add abstract as project description

* Fix linting issue

interim.tex

@@ -13,6 +13,7 @@
 \usepackage[colorinlistoftodos]{todonotes}
 \usepackage[colorlinks=true, allcolors=blue]{hyperref}
 \usepackage{comment}
+\usepackage[numbers]{natbib}
 
 \usepackage{report/title/titlestructure}
 
@@ -29,7 +30,7 @@
 \input{report/title/title.tex}
 
 \begin{abstract}
-\todo{Add abstract here}
+In their distinguished paper ``Relational Algebra by Way of Adjunctions''\cite{RelationalAlgebraByWayOfAdjunctions} it was noted that the monadic structure of bulk types can help explain most of relational algebra. It was found that some operations, such as selections and projections, are more easily reasoned about; this paper completes the rigorous mathematical description of others such as relational join or grouping. The paper takes the novel stance of having a more broad view of adjunctions when dealing with the bulk types in order to make this extension. A theoretically more efficient implementation of joins is an immediate consequence of this approach and the first goal of the project is to benchmark the differences. The project can also be taken into the direction of using this reasoning to mathematically explain other known database query optimisations and potentially invent others.
 \end{abstract}
 
 \begin{comment}
@@ -61,8 +62,8 @@
 \input{report/evaluation/evaluationplan.tex}
 \input{report/ethics/ethicalissues.tex}
 
-\bibliographystyle{alpha}
+\bibliographystyle{unsrtnat}
 % DoC uses the Vancouver Referencing Format.
-\bibliography{bibs/interim}
+\bibliography{report/bibs/interim}
 
 \end{document}

report/bibs/interim.bib

@@ -0,0 +1,14 @@
+@article{RelationalAlgebraByWayOfAdjunctions,
+	author={Jeremy Gibbons and Fritz Henglein and Ralf Hinze and Nicolas Wu},
+	year={2018},
+	month={Jul 30,},
+	title={Relational algebra by way of adjunctions},
+	journal={Proceedings of ACM on programming languages},
+	volume={2},
+	number={ICFP},
+	pages={1-28},
+	abstract={Bulk types such as sets, bags, and lists are monads, and therefore support a notation for database queries based on comprehensions. This fact is the basis of much work on database query languages. The monadic structure easily explains most of standard relational algebra---specifically, selections and projections---allowing for an elegant mathematical foundation for those aspects of database query language design. Most, but not all: monads do not immediately offer an explanation of relational join or grouping, and hence important foundations for those crucial aspects of relational algebra are missing. The best they can offer is cartesian product followed by selection. Adjunctions come to the rescue: like any monad, bulk types also arise from certain adjunctions; we show that by paying due attention to other important adjunctions, we can elegantly explain the rest of standard relational algebra. In particular, graded monads provide a mathematical foundation for indexing and grouping, which leads directly to an efficient implementation, even of joins.},
+	isbn={2475-1421},
+	url={http://dl.acm.org/citation.cfm?id=3236781},
+	doi={10.1145/3236781}
+}