pith. sign in

Convergence of datalog over (Pre-) Semir- ings

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

fields

cs.PL 2 cs.DB 1

years

2026 3

verdicts

UNVERDICTED 3

clear filters

representative citing papers

The Role of Semirings in Incremental View Maintenance

cs.DB · 2026-06-05 · unverdicted · novelty 8.0

For insert-only IVM of self-join-free conjunctive queries over semirings without additive inverses (natural, provenance, covariance, tropical), amortized constant update time plus constant delay holds iff the query is α-acyclic p-hierarchical.

Finite Functional Programming

cs.PL · 2026-04-28 · unverdicted · novelty 7.0

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

cs.PL · 2026-05-14 · unverdicted · novelty 6.0

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

Showing 3 of 3 citing papers after filters.

  • The Role of Semirings in Incremental View Maintenance cs.DB · 2026-06-05 · unverdicted · none · ref 19

    For insert-only IVM of self-join-free conjunctive queries over semirings without additive inverses (natural, provenance, covariance, tropical), amortized constant update time plus constant delay holds iff the query is α-acyclic p-hierarchical.

  • Finite Functional Programming cs.PL · 2026-04-28 · unverdicted · none · ref 18

    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 cs.PL · 2026-05-14 · unverdicted · none · ref 1

    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.