Alternatives and similar repositories for cat-fiat

Users that are interested in cat-fiat are comparing it to the libraries listed below

• gergoerdi / syntactic-stlc
  Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)
  ☆13Updated 7 years ago
• ziman / itt
  Tiny dependent calculus with inference of irrelevance and erasure
  ☆15Updated 5 years ago
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 8 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 10 months ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• barrucadu / minifu
  A tutorial on writing a concurrency testing tool in Haskell
  ☆12Updated 7 years ago
• bobatkey / sorting-types
  Typed DSLs for sorting
  ☆19Updated 7 years ago
• effectfully / Eff
  Experiments with effect systems
  ☆12Updated 9 years ago
• ayberkt / Mini-TT
  A tiny implementation of dependent types.
  ☆11Updated 8 years ago
• typeclasses / partial-semigroup
  A partial binary associative operator (appendMaybe :: a → a → Maybe a)
  ☆13Updated last year
• twanvl / ttie
  Type Theory with Indexed Equality
  ☆26Updated 8 years ago
• bitonic / hakyll-agda
  Hakyll support for Agda literate files
  ☆19Updated 4 years ago
• dalaing / type-systems
  ☆23Updated 8 years ago
• philzook58 / lens-algebra
  Type level algebraic "proofs" using lens combinators
  ☆19Updated 6 years ago
• lthms / chain
  Extensible, Type Safe Error Handling in Haskell
  ☆13Updated 4 years ago
• pigworker / WhatRTypes4
  being the materials from my YOW LambdaJam 2016 talk
  ☆11Updated 9 years ago
• elliottt / dang
  A compiler for a strongly typed, haskell-like functional language
  ☆22Updated 7 years ago
• paf31 / partial
  A nullary type class for partial functions
  ☆15Updated 7 years ago
• jship / tao
  Type-level assertion operators
  ☆16Updated 7 years ago
• atzeus / type-aligned
  Various type-aligned sequence data structures.
  ☆21Updated 4 years ago
• dorchard / effectful-explanations-talk
  "Programs that explain their effects" talk material
  ☆17Updated 7 years ago
• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 8 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 years ago
• eugmes / imp
  Compiler for IMP programming language implemented in Haskell
  ☆16Updated 5 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆16Updated 6 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 8 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 8 years ago
• bartavelle / stateWriter
  A RWS like monad without the slow writer stuff
  ☆12Updated 2 years ago
• joom / direct-reflection-for-free
  using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell
  ☆15Updated 5 years ago