Alternatives and similar repositories for STLC:

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

• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 6 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 5 months 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
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆34Updated 4 years ago
• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆14Updated 8 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 4 months ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• conal / agda-cat-linear
  Linear map categories in Agda
  ☆5Updated 2 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆25Updated 8 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• pigworker / Ming
  being the emperor of Mongo, but also a verb
  ☆15Updated 6 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆28Updated 8 years ago
• dalaing / type-systems
  ☆23Updated 7 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 8 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago
• llvm-hs / llvm-hs-typed
  Type Safe LLVM IR ( Experimental )
  ☆49Updated 6 years ago
• paf31 / Embedding-a-Full-Linear-Lambda-Calculus-in-Haskell
  Embedding a Full Linear Lambda Calculus in Haskell
  ☆8Updated 9 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆15Updated 6 years ago
• andreasabel / strong-normalization
  Formalizations of strong normalization proofs
  ☆35Updated 5 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 7 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 7 years ago
• sweirich / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆29Updated 3 years ago