--- a/LINKS	Sat May 05 10:31:00 2018 +0100
+++ b/LINKS	Fri Jun 01 15:28:37 2018 +0100
@@ -1,13 +1,31 @@
-Pictures from teh Starting Forth book
+Compiler courses
+http://www.cse.chalmers.se/edu/year/2017/course/TDA283/lectures/
+http://www.cs.columbia.edu/~sedwards/classes/2017/4115-fall/index.html
+http://www.cs.dartmouth.edu/~mckeeman/cs48/index.html
+===============================
+
+Pictures from the Starting Forth book
 
 https://www.forth.com/starting-forth/2-stack-manipulation-operators-arithmetic/
 
 --------------------------------
+Java Byte Code for SCALA
+https://www.toptal.com/scala/scala-bytecode-and-the-jvm
 
+------------------
 Yeti - ML for the JVM
 https://mth.github.io/yeti/
 http://dot.planet.ee/yeti/intro.html
 
+------------------
+Ocaml for LLVM
+https://github.com/artagnon/rhine-ml 
+
+---------------
+Type inference 
+http://www.calebh.io/Type-Inference-by-Solving-Constraints/
+
+
 
 JVM languages
 https://en.wikipedia.org/wiki/List_of_JVM_languages
@@ -67,6 +85,11 @@
 https://michaelhaywoodblog.wordpress.com
 https://ruslanspivak.com/lsbasi-part1/
 http://selfie.cs.uni-salzburg.at
+https://academy.realm.io/posts/tryswift-samuel-giddins-building-tiny-compiler-swift-ios/
+https://legacy.gitbook.com/book/luxlang/the-lux-programming-language/details
+https://github.com/rhysd/gocaml
+https://github.com/aalhour/awesome-compilers#educational-and-toy-projects
+https://rsms.me/hue-intro
 
 
 automata
@@ -99,4 +122,39 @@
 
 
 Static code analysis
-https://medium.com/@Coder_HarryLee/videos-about-static-code-analysis-7654b40f9a3b
\ No newline at end of file
+https://medium.com/@Coder_HarryLee/videos-about-static-code-analysis-7654b40f9a3b
+
+
+Brainfuck compiler
+https://github.com/PurpleMyst/bf_compiler
+https://www.reddit.com/r/programming/comments/8371tk/a_brainfuck_to_llvm_ir_compiler_written_in_python/
+http://www.wilfred.me.uk/blog/2015/02/21/my-first-llvm-compiler/
+
+===============================
+A simple recursive regular expression matcher written in Scala.
+https://github.com/marconilanna/RegexMatcher
+
+===============================
+A neat little tool to build presentations using the Scala REPL
+https://github.com/marconilanna/REPLesent
+
+
+======================
+Minimal Static Single Assignment Form
+Max Wagner and Denis Lohner
+
+This formalization is an extension to "Verified Construction of Static Single 
+Assignment Form". In their work, the authors have shown that Braun et al.'s 
+static single assignment (SSA) construction algorithm produces minimal SSA form 
+for input programs with a reducible control flow graph (CFG). However Braun et 
+al. also proposed an extension to their algorithm that they claim produces 
+minimal SSA form even for irreducible CFGs.
+In this formalization we support that claim by giving a mechanized proof.
+
+As the extension of Braun et al.'s algorithm aims for removing so-called 
+redundant strongly connected components of phi functions, we show that this 
+suffices to guarantee minimality according to Cytron et al..
+
+https://www.isa-afp.org/entries/Minimal_SSA.shtml
+
+