Probabilistic Functional Logic Programming. - Sandra Dylus; Jan Christiansen; Finn Teegen (PADL, 2018)

Synthesizing Set Functions. - Sergio Antoy; Michael Hanus; Finn Teegen (WFLP, 2018)

One Monad to Prove Them All (Functional Pearl). - Jan Christiansen; Sandra Dylus; Finn Teegen (CoRR, 2018)

Structured Traversal of Search Trees in Constraint-Logic Object-Oriented Programming. - Jan C. Dageförde; Finn Teegen (DECLARE, 2019)

Adding Data to Curry. - Michael Hanus; Finn Teegen (DECLARE, 2019)

One Monad to Prove Them All. - Sandra Dylus; Jan Christiansen; Finn Teegen (Art Sci. Eng. Program., 2019)

Memoized Pull-Tabbing for Functional Logic Programming. - Michael Hanus; Finn Teegen (WFLP, 2020)

Research Summary on Implementing Functional Patterns by Synthesizing Inverse Functions. - Finn Teegen (ICLP Technical Communications, 2020)

Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism. - Sandra Dylus; Jan Christiansen; Finn Teegen (Theory Pract. Log. Program., 2020)

Haskell⁻¹: automatic function inversion in Haskell. - Finn Teegen; Kai-Oliver Prott; Niels Bunkenburg (Haskell, 2021)

From Non-determinism to Goroutines: A Fair Implementation of Curry in Go. - Jonas Böhm; Michael Hanus; Finn Teegen (PPDP, 2021)

A Monadic Implementation of Functional Logic Programs. - Michael Hanus; Kai-Oliver Prott; Finn Teegen (PPDP, 2022)

Embedding Functional Logic Programming in Haskell via a Compiler Plugin. - Kai-Oliver Prott; Finn Teegen; Jan Christiansen (PADL, 2023)