Alternatives and similar repositories for notes-on-realizability

Users that are interested in notes-on-realizability are comparing it to the libraries listed below

• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆55Updated last month
• felixwellen / synthetic-zariski
  Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos
  ☆61Updated this week
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆74Updated 3 months ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆63Updated 3 years ago
• 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
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 10 months ago
• AndrasKovacs / antifunext
  antifunext
  ☆34Updated last year
• emilyriehl / yoneda
  comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories
  ☆67Updated 9 months ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆103Updated 3 years ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 2 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆75Updated last week
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆101Updated 9 months ago
• thiagofelicissimo / BiTTs
  ☆25Updated 11 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆60Updated 3 weeks ago
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆59Updated 10 months ago
• gebner / hott3
  HoTT in Lean 3
  ☆80Updated 5 years ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated this week
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆43Updated 4 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆119Updated 2 months ago
• frex-project / idris-frex
  ☆48Updated 2 months ago
• felixwellen / synthetic-geometry
  Synthetic geometry. Probably mostly algebraic geometry.
  ☆24Updated last year
• peterlefanulumsdaine / general-type-theories
  A (formalised) general definition of type theories
  ☆57Updated 4 years ago
• marcusrossel / verified-compiler
  A toy example of a verified compiler.
  ☆29Updated 3 months ago
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• rzrn / ground_zero
  Ground Zero: Lean 4 HoTT Library
  ☆64Updated this week
• jespercockx / ataca
  A TACtic library for Agda
  ☆49Updated 10 months ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆31Updated last month
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 3 years ago
• Beluga-lang / McTT
  Building A Correct-By-Construction Proof Checkers For Type Theories
  ☆21Updated last week