yav / simple-smtLinks
☆21Updated this week
Alternatives and similar repositories for simple-smt
Users that are interested in simple-smt are comparing it to the libraries listed below
Sorting:
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- ☆12Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated 7 months ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Miller/pattern unification in Agda☆68Updated 11 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated last week
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Agda-style equational reasoning in Haskell☆54Updated 6 months ago
- Dependently typed elimination functions using singletons☆28Updated 9 months ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- enumerative property-based testing for Haskell☆52Updated 2 months ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- System F in coq.☆19Updated 10 years ago
- Codo notation for programming with comonads in Haskell☆25Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- The Prettiest Printer☆35Updated last year