yav / simple-smtLinks
☆21Updated 8 months ago
Alternatives and similar repositories for simple-smt
Users that are interested in simple-smt are comparing it to the libraries listed below
Sorting:
- 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
- Austin's supercompiler work☆21Updated 5 years ago
- Agda-style equational reasoning in Haskell☆54Updated 4 months ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated 5 months ago
- Implementing grep in Agda☆33Updated 4 years ago
- Dependently typed elimination functions using singletons☆28Updated 7 months ago
- Codo notation for programming with comonads in Haskell☆26Updated 4 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆12Updated 9 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- xmonad in Coq☆46Updated 13 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- ☆23Updated last year
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- A monadic (and pretty) pretty printer for Haskell☆39Updated 2 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Fine-grained lattice primitives for Haskell☆37Updated last month
- A package re-exporting the verified subset of containers☆20Updated 7 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Regular expressions of types☆16Updated 6 years ago