Index: doc/bibliography/pl.bib
===================================================================
--- doc/bibliography/pl.bib	(revision 1c35c7885153d58fabac2abcd38da34954d7249e)
+++ doc/bibliography/pl.bib	(revision d078afd321a2bcee7aa03836fda5824f0ec823b5)
@@ -1146,10 +1146,18 @@
     author	= {Tarditi, David and Elliott, Archibald Samuel and Ruef, Andrew and Hicks, Michael},
     title	= {Checked C: Making C Safe by Extension},
-    booktitle	= {2018 IEEE Cybersecurity Development (SecDev)}, 
-    publisher	= {IEEE},
-    year	= {2018},
-    month	= seep,
-    pages	= {53-60},
-    url		= {https://www.microsoft.com/en-us/research/publication/checkedc-making-c-safe-by-extension/},
+    booktitle	= {2018 IEEE Cybersecurity Development (SecDev)}
+    year = {2018},
+    month = {September},
+    pages = {53-60},
+    publisher = {IEEE},
+    url = {https://www.microsoft.com/en-us/research/publication/checkedc-making-c-safe-by-extension/},
+}
+
+@misc{Clang,
+    keywords = {clang},
+    contributer = {a3moss@uwaterloo.ca},
+    title = {Clang: a {C} language family frontend for {LLVM}},
+    howpublished = {\href{https://clang.llvm.org/}{https://\-clang.llvm.org/}},
+    note = {Accessed 2019-02-22}
 }
 
@@ -2404,4 +2412,13 @@
 }
 
+@misc{Dotty-github,
+    keywords = {dotty,scala},
+    contributer = {a3moss@uwaterloo.ca},
+    author = {Martin Odersky},
+    title = {Dotty},
+    howpublished = {\href{https://github.com/lampepfl/dotty}{https://\-github.com/\-lampepfl/\-dotty}},
+    note = {Acessed: 2019-02-22}
+}
+
 @unpublished{Duff83,
     keywords	= {C, switch statement, control flow},
@@ -2509,4 +2526,25 @@
     pages	= {325-361},
 }
+
+@article{Tarjan75,
+ keywords = {union-find},
+ contributer = {a3moss@uwaterloo.ca},
+ author = {Tarjan, Robert Endre},
+ title = {Efficiency of a Good But Not Linear Set Union Algorithm},
+ journal = {J. ACM},
+ issue_date = {April 1975},
+ volume = {22},
+ number = {2},
+ month = apr,
+ year = {1975},
+ issn = {0004-5411},
+ pages = {215--225},
+ numpages = {11},
+ url = {http://doi.acm.org/10.1145/321879.321884},
+ doi = {10.1145/321879.321884},
+ acmid = {321884},
+ publisher = {ACM},
+ address = {New York, NY, USA},
+} 
 
 @book{Eiffel,
@@ -4262,4 +4300,16 @@
 }
 
+@misc{Matsakis17,
+    keywords	= {Rust, Chalk, PROLOG},
+    contributer	= {a3moss@uwaterloo.ca},
+    author	= {Nicholas Matsakis},
+    title	= {Lowering {Rust} traits to logic},
+    month	= jan,
+    year	= 2017,
+    howpublished= {\href{http://smallcultfollowing.com/babysteps/blog/2017/01/26/lowering-rust-traits-to-logic/}
+		  {http://smallcultfollowing.com/\-babysteps/\-blog/\-2017/\-01/\-26/\-lowering-rust-traits-to-logic/}},
+    optnote	= {Accessed: 2019-01},
+}
+
 @article{Cormack89,
     keywords	= {parsing, LR, error recovery},
@@ -4294,4 +4344,17 @@
     publisher	= {Motorola},
     year	= 1992,
+}
+
+@misc{Haberman16,
+    keywords	= {C++ template expansion},
+    contributer	= {a3moss@uwaterloo.ca},
+    author	= {Josh Haberman},
+    title	= {Making arbitrarily-large binaries from fixed-size {C}{\kern-.1em\hbox{\large\texttt{+\kern-.25em+}}} code},
+    year	= 2016,
+    howpublished= {\href{http://blog.reverberate.org/2016/01/making-arbitrarily-large-binaries-from.html}
+		  {
+          {http://blog.reverberate.org/\-2016/\-01/\-making-arbitrarily-large-binaries-from.html}
+          }},
+    optnote	= {Accessed: 2016-09},
 }