Alternatives and similar repositories for sequoia

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

• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• sweirich / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆29Updated 4 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• TOTBWF / cubical-categories
  Category theory formalized in cubical agda
  ☆21Updated 5 years ago
• jespercockx / agda2scheme
  Compiler backend for generating Scheme code
  ☆26Updated last year
• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆46Updated 5 months ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 4 years ago
• wenkokke / priority-sesh
  Session Types with Priority in Linear Haskell
  ☆27Updated last year
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 2 months ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆55Updated 3 months ago
• sjoerdvisscher / proarrow
  Haskell library for doing category theory with a central role for profunctors
  ☆23Updated last week
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• TheMatten / hask
  Funny little Haskell impl
  ☆18Updated 4 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 6 years ago
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 9 months ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆54Updated 3 months ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆39Updated last month
• laMudri / quantitative
  ☆16Updated 3 years ago
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 8 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 9 months ago
• haskellari / some
  Existential type.
  ☆37Updated 9 months ago
• basic-calculus / prologish
  ☆12Updated 5 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆29Updated 4 years ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆34Updated 4 years ago