Alternatives and similar repositories for storm:

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

• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆28Updated 4 years ago
• re-xyr / avail
  Low-overhead effect management for concrete monads
  ☆37Updated 3 years ago
• hydrolarus / toml-idr
  A TOML parser for Idris 2
  ☆17Updated 10 months ago
• wenkokke / idris-sesh
  Session types in Idris2!
  ☆27Updated 4 years ago
• nikivazou / EquationalReasoningInLiquidHaskell
  Derivation of Optimized Definitions Based on Specs
  ☆15Updated 5 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• wenkokke / chez-scheme-hs
  Haskell bindings to Chez Scheme
  ☆10Updated last year
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆24Updated last year
• chessai / semirings
  semirings and *-semirings of types in base/haskell-platform
  ☆42Updated 11 months ago
• SamuelSchlesinger / stm-incremental
  A very simple interface for incremental computation using STM in Haskell.
  ☆13Updated 2 years ago
• karroffel / Idris2-Ocaml
  OCaml backend for Idris2
  ☆19Updated 4 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆44Updated 2 years ago
• llvm-hs / llvm-hs-typed
  Type Safe LLVM IR ( Experimental )
  ☆49Updated 6 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• andgate / type-theory-compiler
  Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…
  ☆43Updated 5 years ago
• re-xyr / speff
  Fast higher-order effect handlers with evidence passing
  ☆20Updated last year
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 10 months ago
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆53Updated last year
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated 2 weeks ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 5 years ago
• Qqwy / haskell-symbolize
  Implementation of an efficient thread-safe global Symbol Table, with garbage collection
  ☆19Updated last month
• ennocramer / monad-dijkstra
  Haskell monad transformer for weighted, non-deterministic computation
  ☆30Updated 3 months ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated last month
• nomeata / haskell-rec-def
  APIs for more recursive definitions
  ☆19Updated 6 months ago
• JoeyEremondi / lambda-pi-constraint
  ☆16Updated 2 months ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆32Updated 7 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• eviefp / logic-in-haskell
  Classical Logic in Haskell
  ☆24Updated last month