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.
In: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
LeetProof achieves higher rates of fully certified program synthesis from natural language by using a multi-modal verifier in Lean to validate specifications via randomized testing and delegate proofs to AI tools, outperforming single-mode baselines on benchmarks while uncovering defects in prior参考.
The qufinite ZXW calculus is complete for the category FHilb of finite-dimensional Hilbert spaces, as any diagram rewrites to a unique normal form.
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.
-
Certified Program Synthesis with a Multi-Modal Verifier
LeetProof achieves higher rates of fully certified program synthesis from natural language by using a multi-modal verifier in Lean to validate specifications via randomized testing and delegate proofs to AI tools, outperforming single-mode baselines on benchmarks while uncovering defects in prior参考.
-
Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory
The qufinite ZXW calculus is complete for the category FHilb of finite-dimensional Hilbert spaces, as any diagram rewrites to a unique normal form.