yav / simple-smt
☆21Updated 4 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:
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ☆12Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆32Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated last week
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- The Prettiest Printer☆34Updated last year
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- Constructive Galois connections☆32Updated 7 years ago
- Type Your Matrices For Great Good☆30Updated 4 years ago
- System F in coq.☆19Updated 10 years ago
- Session Types with Priority in Linear Haskell☆26Updated 11 months ago
- Mtac in Agda☆28Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- ☆31Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago