M.Sc. Sascha Rechenberger
I'm mainly interested in the theory of (mostly) declarative, especially functional, programming languages like Haskell, Lisp, or Prolog, as well as languages influence by this paradigm, like Kotlin. This also includes various topics of compiler construction, like program analysis or program transformation.
Besides that, I'm interested in algorithm theory, including complexity theory and computability theory, especially concerning boolean satisfiability (SAT), as well as cryptography and machine learning.
Informationstheoretische Analyse von SLS-Solvern
Institut für Theoretische Informatik
Developing an Optimizing Compiler for the Game Boy as a Software Engineering Project
Software Engineering Education and Training Track of the 40th International Conference on Software Engineering (ICSE SEET 2018), Gothenburg, Sweden
Monadische Interpretation multiparadigmatischer Sprachkonstrukte
Summer Term 2020
- Proseminar: Rule Based Models of Computation