Alternatives and similar repositories for stlc

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

• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆55Updated last month
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 3 years ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆103Updated 3 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 4 months 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
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆74Updated 7 months ago
• AndrasKovacs / antifunext
  antifunext
  ☆34Updated last year
• felixwellen / synthetic-zariski
  Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos
  ☆65Updated this week
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆102Updated last month
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆63Updated last year
• logsem / mitten_preorder
  ☆30Updated 2 years ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆32Updated last month
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆75Updated 5 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆61Updated 2 months ago
• thiagofelicissimo / BiTTs
  ☆25Updated last year
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated last week
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 3 weeks ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆43Updated 5 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated last month
• jespercockx / ataca
  A TACtic library for Agda
  ☆49Updated last year
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• frex-project / idris-frex
  ☆48Updated last month
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆47Updated 3 years ago
• jonsterling / project-pterosaur
  ☆20Updated 5 months ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 3 years ago
• emilyriehl / yoneda
  comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories
  ☆68Updated 11 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 years ago
• Trebor-Huang / combinator-nbe
  Normalization by evaluation of simply typed combinators.
  ☆26Updated 3 years ago
• um-catlab / cubical-categorical-logic
  Extensions to cubical for categorical logic/type theory
  ☆32Updated this week