Alternatives and similar repositories for STLC

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

• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 years ago
• gergoerdi / universe-of-syntax
  A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…
  ☆16Updated 7 years ago
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 6 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆27Updated 9 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated 9 months ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 8 months ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• pigworker / Ming
  being the emperor of Mongo, but also a verb
  ☆15Updated 6 years ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆31Updated 12 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 7 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• yoricksijsling / ornaments-thesis
  My master thesis about generic programming and ornaments
  ☆16Updated 9 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆35Updated 5 years ago
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆34Updated 3 years ago
• ziman / itt
  Tiny dependent calculus with inference of irrelevance and erasure
  ☆15Updated 5 years ago
• joom / WangsAlgorithm
  A classical propositional theorem prover in Haskell, using Wang's Algorithm.
  ☆36Updated 6 years ago
• dalaing / type-systems
  ☆23Updated 8 years ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 2 months ago
• jmchapman / Relative-Monads
  Relative Monad Library for Agda
  ☆24Updated 6 years ago
• mietek / et-lang
  ET (IPL) language interpreters and literature
  ☆26Updated 6 years ago
• andreasabel / strong-normalization
  Formalizations of strong normalization proofs
  ☆35Updated 6 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆16Updated 6 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago