Alternatives and similar repositories for formal-logic

Users that are interested in formal-logic are comparing it to the libraries listed below

• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆53Updated 3 months ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆73Updated 3 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆65Updated 6 years ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆46Updated 3 years ago
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 5 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 3 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• byorgey / type-matrices
  Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff
  ☆14Updated 7 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• SuperpowersCorp / refactorio
  Refactorio is a tool with which you build and maintain software.
  ☆19Updated last year
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 6 months ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 7 years ago
• mikeshulman / cohesivett
  Cohesive type theory
  ☆19Updated 3 years ago
• msp-strath / ZEUG
  being the beginnings of at least zero typecheckers
  ☆34Updated 8 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆53Updated last month
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 8 years ago
• pa-ba / McCarthy-Painter
  Coq proof for the paper "Compiling a Fifty Year Journey"
  ☆13Updated 7 years ago
• david-christiansen / final-pretty-printer
  A monadic (and pretty) pretty printer for Haskell
  ☆38Updated 2 years ago
• joom / direct-reflection-for-free
  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
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 14 years ago