2020/09/17 by Finn Teegen
Computer Science · Mathematics · #Algebra over a field #Algorithm #Combinatory logic #Computer science #Curry #Formal Methods in Verification #Functional programming #Inverse #Inverse function #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Mathematics #Programming language #Pure mathematics #Theoretical computer science #Unification #cs.PL
paper · pdf · doi:10.4204/eptcs.325.39
published in Electronic Proceedings in Theoretical Computer Science 325, 296-302 (Open Publishing Association) · In Proceedings ICLP 2020, arXiv:2009.09158
openalex publication_date 2020/09/17 · arxiv created 2020/09/22 · arxiv updated 2020/09/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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. The setting of a functional-logic language especially allows the inversion of non-injective functions. In general, inverse computation is a non-trivial problem in lazy programming languages due to their non-strict semantics. We are so far able to directly derive the inverse function for a limited class of functions, namely those consisting of rules that do not involve both extra variables and non-linear right-hand sides. Because the synthesized definitions are based on standard code, known optimizations techniques can be applied to them. For all other functions we can still provide an inverse function by using non-strict unification.