joom / WangsAlgorithm
A classical propositional theorem prover in Haskell, using Wang's Algorithm.
☆36Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for WangsAlgorithm
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 5 years ago
- System F in coq.☆19Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Type Theory with Indexed Equality☆23Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Decision procedures for Presburger arithmetic in Haskell☆29Updated 4 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- ☆17Updated 2 years ago
- xmonad in Coq☆43Updated 12 years ago
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- ☆23Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated 11 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆16Updated 7 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago