Alternatives and similar repositories for pts

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

• jmchapman / Relative-Monads
  Relative Monad Library for Agda
  ☆24Updated 6 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆24Updated 6 years ago
• pigworker / Ming
  being the emperor of Mongo, but also a verb
  ☆15Updated 7 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated last year
• gergoerdi / generic-syntax
  Library implementation of "Generic description of well-scoped, well-typed syntaxes"
  ☆12Updated 7 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 6 years ago
• effectfully / Eff
  Experiments with effect systems
  ☆12Updated 9 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 6 years ago
• thsutton / cha
  A port of miniprl to Haskell with co-/inductive types bolted on the side.
  ☆22Updated 9 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆16Updated 6 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• sweirich / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆29Updated 4 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 7 months ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• ziman / itt
  Tiny dependent calculus with inference of irrelevance and erasure
  ☆15Updated 6 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆21Updated 3 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 6 years ago
• gergoerdi / stlc-agda
  STLC-related snippets in Agda
  ☆16Updated 12 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 10 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆26Updated 7 years ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 6 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 9 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 6 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• bitonic / tog
  ☆26Updated 9 years ago
• TheMatten / hask
  Funny little Haskell impl
  ☆18Updated 5 years ago
• HuwCampbell / idris-lens
  van Laarhoven lenses for Idris
  ☆20Updated 8 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated last month