Alternatives and similar repositories for salt:

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

• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 6 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 9 months ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• llvm-hs / llvm-hs-typed
  Type Safe LLVM IR ( Experimental )
  ☆49Updated 6 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• mstksg / mutable
  Automatic piecewise-mutable references for your types
  ☆42Updated 4 years ago
• kowainik / treap
  Efficient implementation of the implicit treap data structure
  ☆63Updated 3 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• robrix / sequoia
  classical sequent calculus, embedded in Haskell
  ☆19Updated 3 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• sheaf / acts
  Haskell library for semigroup actions and torsors
  ☆60Updated last month
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆72Updated 3 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 6 years ago
• chrisdone-archive / prana
  Interpreter for GHC Haskell
  ☆22Updated 5 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆76Updated 11 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated last year
• vmchale / atspkg
  Build tool for ATS.
  ☆41Updated 2 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 7 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 7 months ago
• csabahruska / jhc-components
  JHC Haskell compiler split into reusable components
  ☆58Updated 6 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆49Updated 3 months ago
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆35Updated 4 months ago
• karroffel / Idris2-Ocaml
  OCaml backend for Idris2
  ☆19Updated 4 years ago
• Bodigrim / bitvec
  Bit vectors: 8x less memory, up to 3500x faster than Vector Bool
  ☆72Updated 2 months ago