Alternatives and similar repositories for interactive-natural-deduction:

Users that are interested in interactive-natural-deduction are comparing it to the libraries listed below

• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆28Updated 3 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 2 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• LightAndLight / lambdapi
  Educational implementation of dependent types
  ☆19Updated 6 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 5 months ago
• dalaing / type-systems
  ☆23Updated 7 years ago
• esmolanka / sexp-grammar
  Invertible parsing for S-expressions
  ☆34Updated 6 months ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 2 years ago
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆12Updated 6 years ago
• gonzaw / extensible-records
  Extensible records for Idris
  ☆26Updated 3 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• frelindb / agsyHOL
  ☆22Updated 8 years ago
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 7 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 7 years ago
• zilberstein / system-fc-coq
  ☆12Updated 9 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• xgrommx / agda-ecosystem
  ☆30Updated 6 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 2 weeks ago
• nikivazou / EquationalReasoningInLiquidHaskell
  Derivation of Optimized Definitions Based on Specs
  ☆15Updated 5 years ago
• david-christiansen / derive-all-the-instances
  Work on type class deriving with elaboration reflection
  ☆32Updated 6 years ago
• timjs / idris-clean
  A priliminary backend for Idris that compiles to Clean.
  ☆15Updated 7 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 3 months ago
• sinelaw / hmf
  A copy of Daan Leijen's reference implementation of HMF (type inference)
  ☆16Updated 8 years ago