pith. sign in
Pith Number

pith:O2T66WJJ

pith:2026:O2T66WJJFIRWK3ZNNHRQRLZYJ5
not attested not anchored not stored refs resolved

Polymorphic Bottom-Up Weighted Relational Programming

Dmitri Volkov

Polymorphic semiringKanren programs compile to non-polymorphic versions via equality patterns and large instances while preserving semantics.

arxiv:2605.15406 v1 · 2026-05-14 · cs.PL

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{O2T66WJJFIRWK3ZNNHRQRLZYJ5}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We describe a new method to compile polymorphic semiringKanren programs into non-polymorphic ones, based on equality patterns and large-enough instances of polymorphic relations. We prove the correctness of this method.

C2weakest assumption

That equality patterns together with sufficiently large concrete instances of each polymorphic relation are enough to preserve the full semantics and weighting behavior of the original polymorphic program for every possible input.

C3one line summary

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.

References

33 extracted · 33 resolved · 3 Pith anchors

[1] Convergence of datalog over (Pre-) Semir- ings 2024 · doi:10.1145/3643027
[2] Polymorphism in Datalog and Inheritance in a Metamodel 2010
[3] FormuLog: Datalog for static analysis involving logical formulae 2018 · arXiv:1809.06274
[4] Testing Polymorphic Properties 2010
[5] miniKanren, live and un- tagged: quine generation via relational interpreters (programming pearl) 2012 · doi:10.1145/2661103.2661105

Formal links

2 machine-checked theorem links

Receipt and verification
First computed 2026-05-20T00:00:56.981853Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

76a7ef59292a23656f2d69e308af384f5e29dab8602438b8becfc3c727f7ce74

Aliases

arxiv: 2605.15406 · arxiv_version: 2605.15406v1 · doi: 10.48550/arxiv.2605.15406 · pith_short_12: O2T66WJJFIRW · pith_short_16: O2T66WJJFIRWK3ZN · pith_short_8: O2T66WJJ
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/O2T66WJJFIRWK3ZNNHRQRLZYJ5 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 76a7ef59292a23656f2d69e308af384f5e29dab8602438b8becfc3c727f7ce74
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "459e62aa367d9c652d9d26da92717f1f15b12a7d801f120e07220b45ae188604",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.PL",
    "submitted_at": "2026-05-14T20:43:52Z",
    "title_canon_sha256": "b8b19479b18f3ddd497d3510ed26d00376bde6115a05ccf7267ad8ac05840bc2"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.15406",
    "kind": "arxiv",
    "version": 1
  }
}