activity
20182026
most citedOne Monad to Prove Them All

7 citations · 14 across the 6 of their papers we have counts for

collaborators

8 papers

cs.PL2026★ 4 cited

A Monadic Implementation of Functional Logic Programs

Michael Hanus, Kai-Oliver Prott, Finn Teegen

Functional logic languages are a high-level approach to programming by combining the most important declarative features. They abstract from small-step operational details so that…

cs.PL2020

Research Summary on Implementing Functional Patterns by Synthesizing Inverse Functions

Finn Teegen

In this research summary we present our recent work on implementing functional patterns with inverse functions in the lazy functional-logic programming language Curry. Our goal is…

cs.PL2020

Memoized Pull-Tabbing for Functional Logic Programming

Michael Hanus, Finn Teegen

Pull-tabbing is an evaluation technique for functional logic programs which computes all non-deterministic results in a single graph structure. Pull-tab steps are local graph trans…

cs.PL2019

Adding Data to Curry

Michael Hanus, Finn Teegen

Functional logic languages can solve equations over user-defined data and functions. Thus, the definition of an appropriate meaning of equality has a long history in these language…

cs.PL2019★ 3 cited

Structured Traversal of Search Trees in Constraint-logic Object-oriented Programming

Jan C. Dageförde, Finn Teegen

In this paper, we propose an explicit, non-strict representation of search trees in constraint-logic object-oriented programming. Our search tree representation includes both the n…

cs.PL2019

Implementing a Library for Probabilistic Programming using Non-strict Non-determinism

Sandra Dylus, Jan Christiansen, Finn Teegen

This paper presents PFLP, a library for probabilistic programming in the functional logic programming language Curry. It demonstrates how the concepts of a functional logic program…

cs.PL2018

Synthesizing Set Functions

Sergio Antoy, Michael Hanus, Finn Teegen

Set functions are a feature of functional logic programming to encapsulate all results of a non-deterministic computation in a single data structure. Given a function of a func…

cs.PL2018★ 7 cited

One Monad to Prove Them All

Sandra Dylus, Jan Christiansen, Finn Teegen

One Monad to Prove Them All is a modern fairy tale about curiosity and perseverance, two important properties of a successful PhD student. We follow the PhD student Mona on her adv…