dbueno / funsat
An efficient, embeddable DPLL SAT solver in Haskell
☆37Updated 9 years ago
Related projects ⓘ
Alternatives and complementary repositories for funsat
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- NbE course @ Chalmers☆28Updated 2 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- Literature review of GHC's Core language, System FC☆66Updated 6 years ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆57Updated 8 months ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Agda programming with holes☆26Updated 3 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆60Updated last year
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 7 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 5 years ago
- Constructive Galois connections☆32Updated 6 years ago
- ☆45Updated 5 years ago
- gallina frontend for CompCert☆17Updated 5 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆14Updated 6 years ago
- Formalisation of Goedel's System T in Coq☆15Updated 13 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 5 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- The Prettiest Printer☆35Updated 9 months ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆32Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago
- YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…☆36Updated last year