Reproduce “Functional Logic Programming: Improving Logic Programs with Ease” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Michael Hanus
The paper transforms selected predicate arguments into nested functions evaluated on demand, while forcing computations that may fail. This lets the program retain relational flexibility without skipping failing subgoals. In the `thirdof(o,T)` example, Prolog finds zero but does not finish its all-answers search; Curry/KiCS2 completes it in 0.01 seconds. The claim concerns pure logic programs, not a general elapsed-time guarantee.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.