4 citations · 6 across the 6 of their papers we have counts for
6 papers
Functional Logic Program Transformations
Michael Hanus, Steven Libby
Many tools used to process programs, like compilers, analyzers, or verifiers, perform transformations on their intermediate program representation, like abstract syntax trees. Impl…
An Execution Model for RICE
Steven Libby
In this paper, we build on the previous work of the RICE compiler by giving its execution model. We show the restrictions to the FlatCurry language that were made to produce execut…
ICurry
Sergio Antoy, Michael Hanus, Andy Jost +1
FlatCurry is a well-established intermediate representation of Curry programs used in compilers that translate Curry code into Prolog and Haskell code. Some FlatCurry constructs ha…
Making Bubbling Practical
Sergio Antoy, Steven Libby
Bubbling is a run-time graph transformation studied for the execution of non-deterministic steps in functional logic computations. This transformation has been proven correct, but…
Proving Non-Deterministic Computations in Agda
Sergio Antoy, Michael Hanus, Steven Libby
We investigate proving properties of Curry programs using Agda. First, we address the functional correctness of Curry functions that, apart from some syntactic and semantic differe…
Needed Computations Shortcutting Needed Steps
Sergio Antoy, Jacob Johannsen, Steven Libby
We define a compilation scheme for a constructor-based, strongly-sequential, graph rewriting system which shortcuts some needed steps. The object code is another constructor-based…