mietek / formal-logicLinks
TODO
☆23Updated 10 years ago
Alternatives and similar repositories for formal-logic
Users that are interested in formal-logic are comparing it to the libraries listed below
Sorting:
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Agda-style equational reasoning in Haskell☆54Updated 8 months ago
- Recursion schemes for Idris☆64Updated 7 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- ☆23Updated 8 years ago
- second-order abstract syntax☆31Updated 4 years ago
- A playground for type theory implementations in Racket☆20Updated 10 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Alternative Core language for GHC plugins☆39Updated 9 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff☆14Updated 7 years ago
- Provides a type-safe way of working with permutations in Idris☆37Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A small bifunctor library for idris☆21Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 10 years ago