Alternatives and similar repositories for logix

Users that are interested in logix are comparing it to the libraries listed below

• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 3 weeks ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago
• jwiegley / coq-cds4ltl
  A formal verification of Linear Temporal Logic in Coq
  ☆23Updated 2 months ago
• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 8 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 years ago
• MatthewDaggitt / agda-routing
  An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
  ☆28Updated 2 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 7 years ago
• LightAndLight / parametricity-proofs
  Proofs of the number of inhabitants of polymorphic functions
  ☆23Updated 7 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
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆32Updated 3 weeks ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 7 months ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• eugmes / imp
  Compiler for IMP programming language implemented in Haskell
  ☆16Updated 5 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆29Updated 4 years ago
• bitonic / tog
  ☆26Updated 9 years ago
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 8 years ago
• gergoerdi / generic-syntax
  Library implementation of "Generic description of well-scoped, well-typed syntaxes"
  ☆12Updated 7 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 6 years ago
• laMudri / quantitative
  ☆16Updated 4 years ago
• ziman / itt
  Tiny dependent calculus with inference of irrelevance and erasure
  ☆15Updated 6 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 10 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆26Updated 7 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated 2 months ago
• jonsterling / sml-logical-framework
  Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought
  ☆14Updated 8 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• hazelgrove / agda-popl17
  Mechanization of Hazelnut, as submitted to POPL 2017
  ☆16Updated 4 years ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago