konn / herbrand Public

Notifications You must be signed in to change notification settings
Fork 0
Star 11

An experiment around automated theorem proving in Haskell

11 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 395 Commits
.github/workflows		.github/workflows
.vscode		.vscode
app		app
bench		bench
ci		ci
data		data
libs		libs
src		src
test		test
.gitignore		.gitignore
CHANGELOG.md		CHANGELOG.md
LICENSE		LICENSE
README.md		README.md
Setup.hs		Setup.hs
cabal-prof.project		cabal-prof.project
cabal.project		cabal.project
cabal.project.freeze		cabal.project.freeze
fourmolu.yaml		fourmolu.yaml
herbrand.cabal		herbrand.cabal
package.yaml		package.yaml

Repository files navigation

Herbrand - Playground for experimenting with decision procedures in Haskell

References

A. Zeljić: "CS 357 Advanced Topics in Formal Methods".
G. Nelson and D. C. Oppen: "Fast Decision Procedures Based on Congruence Closure".
P. J. Downey, R. Sethi, and R. E. Tarjan: "Variations on the Common Subexpression Problem".
D. C. Oppen: "Complexity, Convexity and Combinations of Theories"
M. Willsey, C.Nandi, Y. R. Wang, O. Flatt, Z. Tatlock, and P. Panchekha: "egg: Fast and Extensible Equality Saturation". POPL '21.
R. Mesquita: "hegg: Fast equality saturation in Haskell".
H. Nabeshima and T. Soh: "高速 SAT ソルバーの原理 (Principles of Modern SAT Solvers)".
K. Iwanuma and H. Nabeshima: SMT: 個別理論を取り扱うSAT技術 (SMT: Satisfiability Modulo Theories).
H. H. Hoos and T. Stützle: "SATLib".
E. Torlak: "A Modern SAT Solver". In the course material of "CSE 507: Computer-Aided Reasoning for Software".
J. H. Liang, V. Ganesh, E. Zulkoski, A. Zaman, and K. Czarnecki: "Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers".
H. Wu: "Randomization and Restart Strategies". Master's Thesis. 2006

About

An experiment around automated theorem proving in Haskell

Report repository

Releases

No releases published

Packages

No packages published

Languages