Finite functional programming unifies functional and logic programming by treating predicates as finitely supported functions represented as data, with a type system for checking support using graded effects and relevance types.
Convergence of datalog over (Pre-) Semir- ings
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.PL 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Presents a compilation method that turns polymorphic semiringKanren programs into equivalent non-polymorphic ones via equality patterns and sufficiently large relation instances, together with a correctness proof.
citing papers explorer
-
Finite Functional Programming
Finite functional programming unifies functional and logic programming by treating predicates as finitely supported functions represented as data, with a type system for checking support using graded effects and relevance types.
-
Polymorphic Bottom-Up Weighted Relational Programming
Presents a compilation method that turns polymorphic semiringKanren programs into equivalent non-polymorphic ones via equality patterns and sufficiently large relation instances, together with a correctness proof.