Alternatives and similar repositories for pi-eta-epsilon

Users that are interested in pi-eta-epsilon are comparing it to the libraries listed below

• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆38Updated 14 years ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆48Updated 3 years ago
• llvm-hs / llvm-hs-typed
  Type Safe LLVM IR ( Experimental )
  ☆49Updated 7 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆54Updated 9 months ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 12 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 7 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated last year
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• jwiegley / coq-cds4ltl
  A formal verification of Linear Temporal Logic in Coq
  ☆23Updated last month
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆34Updated 3 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 8 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆128Updated last year
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆26Updated 7 years ago
• jwiegley / z3cat
  Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations
  ☆38Updated 8 years ago
• danr / hipspec
  A hip inductive theorem prover!
  ☆90Updated 4 years ago
• haskell-perf / graphs
  ☆41Updated 5 years ago
• nfrisby / coxswain
  A GHC type checker plugin for row types
  ☆39Updated 8 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 7 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 3 years ago
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 years ago
• byorgey / enumeration
  Simple Haskell package for efficiently indexable finite and infinite enumerations.
  ☆12Updated 8 months ago
• esmolanka / sexp-grammar
  Invertible parsing for S-expressions
  ☆34Updated 9 months ago
• jwiegley / categorical
  Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work
  ☆19Updated 7 years ago
• andgate / type-theory-compiler
  Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…
  ☆44Updated 6 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago