Alternatives and similar repositories for formal-logic

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

• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 6 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 5 months ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆46Updated 3 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆53Updated last month
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• gallais / agda-presburger
  Deciding Presburger arithmetic in agda
  ☆32Updated 2 years ago
• vmchale / permutations
  Provides a type-safe way of working with permutations in Idris
  ☆35Updated 3 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• xgrommx / agda-ecosystem
  ☆30Updated 7 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆34Updated last year
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 6 months ago
• esengie / fpl-exploration-tool
  Diploma work (if this is still here contact me if you need details)
  ☆13Updated 8 years ago
• esmolanka / sexp-grammar
  Invertible parsing for S-expressions
  ☆34Updated last month
• dalaing / type-systems
  ☆23Updated 7 years ago
• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆14Updated 8 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 2 years ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• pa-ba / McCarthy-Painter
  Coq proof for the paper "Compiling a Fifty Year Journey"
  ☆13Updated 7 years ago
• HuwCampbell / idris-lens
  van Laarhoven lenses for Idris
  ☆20Updated 7 years ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆45Updated 2 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• kowainik / first-class-patterns
  First class patterns and pattern matching, using type families
  ☆17Updated 4 years ago