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
- Agda-style equational reasoning in Haskell☆52Updated 2 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Deciding Presburger arithmetic in agda☆31Updated last year
- Recursion schemes for Idris☆64Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- ☆17Updated 2 years ago
- The Prettiest Printer☆35Updated last year
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Refactorio is a tool with which you build and maintain software.☆19Updated 9 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- ☆30Updated 6 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 3 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Codo notation for programming with comonads in Haskell☆26Updated 4 years ago
- My Agda experiments☆12Updated 5 years ago
- being the beginnings of at least zero typecheckers☆33Updated 7 years ago
- Cohesive type theory☆19Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated last week
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆48Updated 3 months ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- A monadic (and pretty) pretty printer for Haskell☆37Updated last year