mietek / formal-logic
TODO
☆23Updated 9 years ago
Alternatives and similar repositories for formal-logic:
Users that are interested in formal-logic are comparing it to the libraries listed below
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- Recursion schemes for Idris☆64Updated 6 years ago
- Diploma work (if this is still here contact me if you need details)☆13Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Agda-style equational reasoning in Haskell☆53Updated last month
- ☆17Updated 2 years ago
- Deciding Presburger arithmetic in agda☆31Updated 2 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 8 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- The Prettiest Printer☆34Updated last year
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- Codo notation for programming with comonads in Haskell☆26Updated 4 years ago
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- ☆26Updated 8 years ago
- A small profunctor library for idris☆17Updated 2 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Dependently typed elimination functions using singletons☆28Updated 4 months ago
- IO using sized types and copatterns☆34Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago