Alternatives and similar repositories for agda-synthetic-domain-theory

Users that are interested in agda-synthetic-domain-theory are comparing it to the libraries listed below

• uemurax / synthetic-topos-theory
  ☆15Updated last year
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 4 months ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• peterlefanulumsdaine / palmgren-archive
  Research material of Erik Palmgren (1963–2019)
  ☆20Updated last month
• UlfNorell / quasi-quote
  Quasi-quoting library for agda
  ☆17Updated 6 months ago
• 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
  ☆22Updated 3 years ago
• CMU-HoTT / serre-finiteness
  ☆15Updated last month
• tomdjong / MGS-categorical-realizability
  Lecture notes and exercises for the advanced course on categorical realizability at the Midlands Graduate School (MGS) 2024
  ☆19Updated 3 months ago
• flupe / generics
  ☆23Updated 11 months ago
• Deducteam / Agda2Dedukti
  ☆19Updated 3 years ago
• limemloh / cubical-congruence
  Congruence Closure Procedure in Cubical Agda
  ☆17Updated 4 years ago
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated 9 months ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆22Updated 5 years ago
• bobatkey / agda-metric-reals
  ☆29Updated 2 years ago
• logsem / mitten_preorder
  ☆29Updated 2 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
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆13Updated last year
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated last year
• rahulc29 / realizability
  Experiments with Realizability in Univalent Type Theory
  ☆18Updated 7 months ago
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 8 months ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated 2 months ago
• 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
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• uemurax / morg
  Organize mathematical thoughts
  ☆20Updated last year
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆17Updated 4 years ago
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆17Updated 10 years ago