Alternatives and similar repositories for agda-soas:

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

• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆49Updated 5 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆57Updated 5 years ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆48Updated 5 months ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 years ago
• coq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆54Updated 4 months ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated last year
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• flupe / generics
  ☆23Updated 7 months ago
• frex-project / idris-frex
  ☆47Updated 2 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆40Updated 4 years ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆61Updated 2 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)…
  ☆44Updated 11 months ago
• AndrasKovacs / antifunext
  antifunext
  ☆31Updated 7 months ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated this week
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆95Updated 4 months ago
• logsem / mitten_preorder
  ☆28Updated last year
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 10 months ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆98Updated 2 years ago
• MevenBertrand / NbEReadingGroup
  A repository for material from the reading group on NbE
  ☆17Updated last year
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆49Updated 6 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆124Updated 9 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆41Updated 4 years ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆28Updated 2 months ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆22Updated 5 years ago
• gebner / hott3
  HoTT in Lean 3
  ☆78Updated 4 years ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆30Updated 12 years ago