Alternatives and similar repositories for linear-logic:

Users that are interested in linear-logic are comparing it to the libraries listed below

• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 6 months ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆52Updated 7 years ago
• Gabriella439 / HasCal
  Haskell embedding of PlusCal
  ☆61Updated 2 years ago
• well-typed / gp-zurihac-2020
  Repository accompanying the ZuriHac Advanced Track lecture on Datatype-Generic Programming
  ☆44Updated 4 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated last year
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆121Updated last month
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆40Updated 4 years ago
• pigworker / CS410-18
  being the teaching materials and exercises for CS410 in the 2018/19 session
  ☆56Updated 5 years ago
• tomjaguarpaw / bluefin
  ☆81Updated 2 weeks ago
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆57Updated last year
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆60Updated last year
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆46Updated 2 years ago
• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆41Updated this week
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 10 months ago
• matt-noonan / justified-containers
  Standard containers, with keys that carry type-level proofs of their own presence.
  ☆80Updated 4 years ago
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆49Updated 6 months ago
• pigworker / so-pigworker
  being the scrapings of my stackoverflow answers
  ☆48Updated 5 years ago
• AndrasKovacs / staged-fusion
  Staged push/pull fusion with typed Template Haskell
  ☆57Updated last year
• chrisdone-archive / prana
  Interpreter for GHC Haskell
  ☆22Updated 5 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated this week
• Lysxia / first-class-families
  First-class type families
  ☆87Updated 5 months ago
• Bodigrim / linear-builder
  Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.
  ☆89Updated 5 months ago
• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆60Updated 3 years ago
• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆56Updated 5 years ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated 9 months ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆71Updated 5 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 7 months ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆95Updated 4 months ago