Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Teegen, Finn"'
Autor:
Teegen, Finn
Publikováno v:
EPTCS 325, 2020, pp. 296-302
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 the synthesis of the inverse of any given function in Curry itself. Th
Externí odkaz:
http://arxiv.org/abs/2009.10254
Autor:
Hanus, Michael, Teegen, Finn
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 transformations to move non-deterministic choices towards the root of an ex
Externí odkaz:
http://arxiv.org/abs/2008.11999
Autor:
Hanus, Michael, Teegen, Finn
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 languages, ranging from reflexive equality in early equational logic languages
Externí odkaz:
http://arxiv.org/abs/1908.10607
Autor:
Dageförde, Jan C., Teegen, Finn
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 non-deterministic and deterministic behaviour during execution of an ap
Externí odkaz:
http://arxiv.org/abs/1908.10264
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 programming language support the implementation of a library for probabilisti
Externí odkaz:
http://arxiv.org/abs/1905.07212
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 $f$ of a functional logic program written in Curry, we describe a technique to synt
Externí odkaz:
http://arxiv.org/abs/1808.07401
Publikováno v:
The Art, Science, and Engineering of Programming, 2019, Vol. 3, Issue 3, Article 8
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 adventure of proving properties about Haskell programs in the proof assis
Externí odkaz:
http://arxiv.org/abs/1805.08059
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dagef��rde, Jan C., Teegen, Finn
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 non-deterministic and deterministic behaviour during execution of an ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91fb8b44c253f6274b68310bca2d1f85
http://arxiv.org/abs/1908.10264
http://arxiv.org/abs/1908.10264