Alternatives and similar repositories for agda-nbe

Users that are interested in agda-nbe are comparing it to the libraries listed below

• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• uemurax / synthetic-topos-theory
  ☆15Updated last year
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 12 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 5 years ago
• lawcho / agda2c
  Agda to C compiler
  ☆10Updated 2 years ago
• rahulc29 / realizability
  Experiments with Realizability in Univalent Type Theory
  ☆18Updated 8 months ago
• Deducteam / Agda2Dedukti
  ☆19Updated 3 years ago
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆22Updated 3 years ago
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆14Updated last year
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆17Updated 7 months ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆26Updated last week
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated 11 months ago
• flupe / generics
  ☆23Updated last year
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 3 years ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 6 years ago
• tomdjong / MGS-categorical-realizability
  Lecture notes and exercises for the advanced course on Categorical Realizability at the Midlands Graduate School (MGS) 2024 and the Europ…
  ☆19Updated this week
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆34Updated 3 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• amblafont / unification
  Notes (and implementation) of unification with binders
  ☆14Updated last month
• laMudri / quantitative
  ☆16Updated 3 years ago
• peterthiemann / definitional-session
  ☆12Updated 5 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• ericfinster / opetopic-types
  Higher Algebra with Opetopic Types
  ☆15Updated 2 years ago
• JorisCeulemans / sikkel
  Multimode simple type theory as an Agda library.
  ☆23Updated 9 months ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• gallais / thesis
  Syntaxes with Binding, Their Programs, and Proofs
  ☆23Updated last year
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated last year
• Zekt / Type-Embellishment
  Experimenting on ornamentation in Agda via reflection.
  ☆12Updated 2 years ago