Alternatives and similar repositories for LEOG

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

• uemurax / synthetic-topos-theory
  ☆15Updated last year
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆22Updated 3 years ago
• rahulc29 / realizability
  Experiments with Realizability in Univalent Type Theory
  ☆19Updated last year
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆18Updated 10 months ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆32Updated 2 months ago
• lawcho / agda2c
  Agda to C compiler
  ☆10Updated 3 weeks ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated last year
• uemurax / morg
  Organize mathematical thoughts
  ☆20Updated 2 years ago
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆14Updated last year
• tomdjong / domain-theory-in-uf
  ☆11Updated 5 years ago
• Beluga-lang / McTT
  Building A Correct-By-Construction Proof Checkers For Type Theories
  ☆26Updated last week
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 5 months ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆31Updated 5 months ago
• cofibrant / agda-nbe
  Verified NbE via gluing in Agda
  ☆11Updated last year
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆26Updated 5 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 6 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
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 3 months ago
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆19Updated 4 years ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• uds-psl / autosubst-ocaml
  ☆16Updated 4 months ago
• AndrasKovacs / antifunext
  antifunext
  ☆34Updated last year
• tomdjong / MGS-domain-theory
  Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…
  ☆46Updated last year
• peterlefanulumsdaine / palmgren-archive
  Research material of Erik Palmgren (1963–2019)
  ☆21Updated 6 months ago
• RedPRL / agda-mugen
  A formalization of the theory behind the mugen library
  ☆19Updated last year
• logsem / mitten_preorder
  ☆30Updated 2 years ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 3 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 7 months ago