joom / WangsAlgorithmLinks
A classical propositional theorem prover in Haskell, using Wang's Algorithm.
☆36Updated 6 years ago
Alternatives and similar repositories for WangsAlgorithm
Users that are interested in WangsAlgorithm are comparing it to the libraries listed below
Sorting:
- Decision procedures for Presburger arithmetic in Haskell☆30Updated 6 months ago
- System F in coq.☆19Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- ☆12Updated 9 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- ☆23Updated 8 years ago
- xmonad in Coq☆46Updated 13 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Category theory and algebra☆26Updated 9 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Semantics for Cryptol☆16Updated 7 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Agda-style equational reasoning in Haskell☆54Updated 6 months ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago