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 2 years ago
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆22Updated 3 years ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆33Updated 3 weeks ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last week
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆18Updated last year
• rahulc29 / realizability
  Experiments with Realizability in Univalent Type Theory
  ☆19Updated last year
• lawcho / agda2c
  Agda to C compiler
  ☆10Updated 4 months ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 5 years ago
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆15Updated 2 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆25Updated 6 years ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated last week
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆32Updated 3 weeks ago
• Beluga-lang / McTT
  Building A Correct-By-Construction Proof Checkers For Type Theories
  ☆29Updated 3 weeks ago
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated last year
• cofibrant / agda-nbe
  Verified NbE via gluing in Agda
  ☆11Updated last year
• Deducteam / Agda2Dedukti
  ☆21Updated 4 years ago
• uemurax / morg
  Organize mathematical thoughts
  ☆21Updated 2 years ago
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 3 months ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 3 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆26Updated 5 years ago
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆20Updated 4 years ago
• AndrasKovacs / antifunext
  antifunext
  ☆38Updated 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)…
  ☆48Updated last month
• peterlefanulumsdaine / palmgren-archive
  Research material of Erik Palmgren (1963–2019)
  ☆21Updated 10 months ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• uds-psl / autosubst-ocaml
  ☆19Updated 2 months ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated 2 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 7 months ago
• jwiegley / coq-lattice
  A reflection-based proof tactic for lattices in Coq
  ☆21Updated 2 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆43Updated 2 months ago