My sandbox for experimenting with solver algorithms.
-
Updated
Feb 27, 2025 - Haskell
My sandbox for experimenting with solver algorithms.
A bioinformatics tool for analyzing somatic hypermutation
Nλ is a simple functional programming language aimed at manipulating infinite, but first-order definable structures, such as the countably infinite clique graph or the set of all intervals with rational endpoints.
Liquid Haskell library for verifying neural networks.
My first SMT solver (only QF_UF)
DSL: automatic derivation of greedy algorithm and dynamic programming
Add a description, image, and links to the smt-solver topic page so that developers can more easily learn about it.
To associate your repository with the smt-solver topic, visit your repo's landing page and select "manage topics."