Alternatives and similar repositories for tandoori

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

• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆53Updated 2 months ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 6 months ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆46Updated 3 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆73Updated 3 years ago
• LeventErkok / sbvPlugin
  Formally prove properties of Haskell programs using SBV/SMT.
  ☆45Updated 3 months ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆53Updated last week
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• jwiegley / z3cat
  Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations
  ☆38Updated 7 years ago
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 5 years ago
• esmolanka / sexp-grammar
  Invertible parsing for S-expressions
  ☆34Updated 2 months ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆30Updated last month
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆34Updated 3 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• dmwit / pi-eta-epsilon
  An interpreter for the language described in "The Two Dualities of Computation: Negative and Fractional Types"
  ☆23Updated 12 years ago
• mietek / research
  Work in progress
  ☆37Updated 2 weeks ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 years ago
• jwiegley / coq-cds4ltl
  A formalization of finite, constructive log analysis using linear temporal logic
  ☆22Updated this week
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• jmchapman / Relative-Monads
  Relative Monad Library for Agda
  ☆24Updated 6 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago