Alternatives and similar repositories for thesis:

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

• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆21Updated 2 years ago
• HarrisonGrodin / agda-modtt
  ModTT in Agda
  ☆11Updated 3 years ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆22Updated 5 years ago
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆17Updated 3 months ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated last week
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 2 years ago
• logsem / mitten_preorder
  ☆29Updated last year
• flupe / generics
  ☆23Updated 8 months ago
• peterthiemann / definitional-session
  ☆12Updated 5 years ago
• RedPRL / agda-mugen
  A formalization of the theory behind the mugen library
  ☆19Updated 8 months ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• uemurax / morg
  Organize mathematical thoughts
  ☆19Updated last year
• limemloh / cubical-congruence
  Congruence Closure Procedure in Cubical Agda
  ☆17Updated 4 years ago
• amblafont / unification
  Notes (and implementation) of unification with binders
  ☆14Updated this week
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 2 years ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆28Updated 3 weeks ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated last year
• ericfinster / opetopic-types
  Higher Algebra with Opetopic Types
  ☆14Updated 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
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 4 years ago
• arthuraa / agda-hoas-demo
  Experiments with higher-order abstract syntax in Agda
  ☆21Updated 2 years ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆29Updated last year
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 2 months ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆17Updated 4 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• gallais / thesis
  Syntaxes with Binding, Their Programs, and Proofs
  ☆23Updated last year