All for one and none forall: Compiling polymorphic relations without monomorphization

[2607.24678] All for one and none forall: Compiling polymorphic relations without monomorphization Skip to main content Search Submit Donate Log in Computer Science > Programming Languages arXiv:2607.24678 (cs) [Submitted on 27 Jul 2026 ( v1 ), last revised 21 Aug 2026 (this version, v2)] Title: All for one and none forall: Compiling polymorphic relations without monomorphization Authors: Dmitri Volkov , Yafei Yang , Chung-Chieh Shan View PDF HTML (experimental) Abstract: We present a new approach for implementing polymorphism for bottom-up relational languages that avoids monomorphization. We begin by introducing semiringKanren, a bottom-up weighted relational programming language. We extend this base language to support polymorphism. 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 explain the correctness of this method. Finally, we consider existing work and suggest directions for future research. Comments: 18 pages, 4 figures, submitted to miniKanren and Relational Programming Workshop 2026, for associated repo see this https URL Subjects: Programming Languages (cs.PL) MSC classes: 68N17 ACM classes: D.3.1; D.3.2; D.3.3; F.3.2 Cite as: arXiv:2607.24678 [cs.PL] (or arXiv:2607.24678v2 [cs.PL] for this version) https://doi.org/10.48550/arXiv.2607.24678 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Dmitri Volkov [ view email ] [v1] Mon, 27 Jul 2026 17:20:23 UTC (26 KB) [v2] Fri, 21 Aug 2026 18:08:25 UTC (26 KB) Full-text links: Access Paper: View PDF HTML (experimental) TeX Source view license Additional Features Audio Summary Current browse context: cs.PL < prev | next > new | recent | 2026-07 Change to browse by: cs References & Citations SciX Google Scholar Semantic Scholar export BibTeX citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)

Related documents

• All for one and none forall: Compiling polymorphic relations without monomorphization#665880
• Syntax-driven Incremental Program Verification of Matching Logic Properties#267716
• Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs#653002
• Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction#1130907
• Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction#1122387