dbueno / funsatLinks
An efficient, embeddable DPLL SAT solver in Haskell
☆37Updated 10 years ago
Alternatives and similar repositories for funsat
Users that are interested in funsat are comparing it to the libraries listed below
Sorting:
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Constructive Galois connections☆35Updated 7 years ago
- NbE course @ Chalmers☆28Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆62Updated last year
- Accepted papers for ICFP 2015☆45Updated 9 years ago
- Lecture material for DeepSpec Summer School 2017☆88Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- ☆22Updated last month
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Miller/pattern unification in Agda☆67Updated 3 weeks ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- ☆45Updated 6 years ago
- ☆84Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- second-order abstract syntax☆31Updated 4 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 7 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 8 years ago
- Agda programming with holes☆28Updated 4 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago