yav / simple-smt
☆21Updated 2 months ago
Alternatives and similar repositories for simple-smt:
Users that are interested in simple-smt are comparing it to the libraries listed below
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- NbE course @ Chalmers☆28Updated 4 months ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆25Updated last year
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆32Updated 2 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 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☆27Updated 4 months ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 2 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 2 months ago
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated 8 months ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- Implementing grep in Agda☆32Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- System F implemented in Haskell☆24Updated 12 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- An experimental intermediate language for GHC☆36Updated 7 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago