A monadic Haskell implementation of functional logic programs that enables memoization in non-deterministic branches, includes advanced features, and outperforms current Curry compilers.
A semantics for weakly encapsulated search in functional logic programs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Monadic Implementation of Functional Logic Programs
A monadic Haskell implementation of functional logic programs that enables memoization in non-deterministic branches, includes advanced features, and outperforms current Curry compilers.