Alternatives and similar repositories for tog:

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

• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 3 months ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 4 months ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated last year
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 3 years ago
• flupe / generics
  ☆23Updated 7 months ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 4 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆21Updated 4 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• logsem / mitten_preorder
  ☆28Updated last year
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆21Updated 5 years ago
• bgamari / the-thoralf-plugin
  This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.
  ☆21Updated 3 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated last month
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆35Updated 5 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 2 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• RedPRL / sml-dependent-lcf
  A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
  ☆16Updated 7 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 5 years ago