Alternatives and similar repositories for gradual-eff-paper

Users that are interested in gradual-eff-paper are comparing it to the libraries listed below

• wenkokke / priority-sesh
  Session Types with Priority in Linear Haskell
  ☆27Updated last year
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆47Updated 3 years ago
• sellout / compiling-anything-to-categories
  a talk about and sample project for the [Categorifier](https://github.org/con-kitty/categorifier) GHC plugin.
  ☆21Updated last year
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 6 months ago
• robrix / sequoia
  classical sequent calculus, embedded in Haskell
  ☆21Updated last month
• gallais / agda-presburger
  Deciding Presburger arithmetic in agda
  ☆32Updated 2 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆55Updated 3 months ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆38Updated last month
• fredefox / cat
  A formalization of category theory in cubical Agda
  ☆59Updated 5 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆54Updated 2 months ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• con-kitty / categorifier
  Interpret Haskell programs into any cartesian closed category.
  ☆63Updated last month
• ConcreteCactus / lcc
  A compiler that translates a form of lambda calculus to C
  ☆12Updated last year
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆56Updated 6 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆70Updated 2 years ago
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆29Updated 4 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 2 months ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• tree-sitter / tree-sitter-agda
  Agda grammar for tree-sitter
  ☆39Updated 3 weeks ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• frex-project / idris-frex
  ☆48Updated last month
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆46Updated 2 months ago