Dependent Types, Proof Development, Ltac Programming, Mathematical Verification
Proof Rules for MetaSMT
philipzucker.com·1d
X Design Notes: Pattern Matching II
blog.polybdenum.com·1d
Writing Our Own Structure: Tries in Haskell & Rust
mmhaskell.com·23h
AC^0[p]-Frege Cannot Efficiently Prove that Constant-Depth Algebraic Circuit Lower Bounds are Hard
arxiv.org·3h
CompileBench: Can AI Compile 22-year-old Code?
simonwillison.net·12h
CogAtom: From Cognitive Atoms to Olympiad-level Mathematical Reasoning in Large Language Models
arxiv.org·3h
Isabelle rule musings
blueberrywren.dev·4d
Loading...Loading more...