Research topics
- type theory
- homotopy type theory
- constructive and computable mathematics
- foundations of mathematics
- mathematical foundations of programming languages
- semantics of programming languages
- algebraic effects and handlers
- formalized mathematics and proof assistants
Research projects
- Type Theory for Data-Intensive Formalization
- Computationally intensive methods in theoretical computer science, discrete mathematics, combinatorial optimization, and numerical analysis and algebra with applications in natural and social sciences (ARRS P1-0294)
Members
- Andrej Bauer, faculty
- Katja Berčič, postdoc
- Filip Koprivec, PhD student
- Davorin Lešnik
- Noah Loutchmia, PhD student
- Matija Pretnar, faculty
- Alex Simpson, faculty
- Jure Taslak, PhD student
- Ljupčo Todorovski, faculty
