seereason / atp-haskell
Haskell version of the code from "Handbook of Practical Logic and Automated Reasoning"
☆16Updated 7 months ago
Related projects ⓘ
Alternatives and complementary repositories for atp-haskell
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Where my everyday research happens☆53Updated 2 months ago
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- System F in coq.☆19Updated 9 years ago
- being a thing I build on a Saturday☆28Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- ☆28Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Codo notation for programming with comonads in Haskell☆26Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- The Prettiest Printer☆35Updated 8 months ago
- Finite domain constraint solver in Haskell☆18Updated 3 years ago
- Agda-style equational reasoning in Haskell☆51Updated 5 months ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago
- Generic functions for single-sorted first-order structural unification☆41Updated last week
- Category theory and algebra☆27Updated 8 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆69Updated 2 years ago
- Fine-grained lattice primitives for Haskell☆35Updated 3 months ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 weeks ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Provides a type-safe way of working with permutations in Idris☆34Updated 3 years ago