Alternatives and similar repositories for LEOG

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

• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆22Updated 3 years ago
• JacquesCarette / Notes
  ☆13Updated 2 months ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• uemurax / morg
  Organize mathematical thoughts
  ☆20Updated last year
• 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
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 6 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• lawcho / agda2c
  Agda to C compiler
  ☆10Updated last week
• uemurax / synthetic-topos-theory
  ☆15Updated last year
• gelisam / typechecker-combinators
  ☆17Updated last year
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆26Updated 4 years ago
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 2 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆18Updated 10 months ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 5 months ago
• rahulc29 / realizability
  Experiments with Realizability in Univalent Type Theory
  ☆19Updated 11 months ago
• jwiegley / coq-lattice
  A reflection-based proof tactic for lattices in Coq
  ☆22Updated last year
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆38Updated last month
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 4 months ago
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• maxsnew / grammars-and-semantic-actions
  Intrinsic Verification of Formal Grammar Theory
  ☆26Updated 2 months ago
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 3 years ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆32Updated last month
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆30Updated this week
• JorisCeulemans / sikkel
  Multimode simple type theory as an Agda library.
  ☆23Updated last year
• sweirich / lambda-calculus
  Denotational Semantics of the Untyped Lambda Calculus
  ☆17Updated 7 months ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• Beluga-lang / McTT
  Building A Correct-By-Construction Proof Checkers For Type Theories
  ☆25Updated last week
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆14Updated last year