Alternatives and similar repositories for kanso:

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

• maybevoid / lambek
  Type-Level Programming in Rust
  ☆27Updated 3 years ago
• ekmett / rust-lens
  this is not a working lens library
  ☆12Updated 2 years ago
• tweag / haskell-binaryen
  Haskell bindings to binaryen.
  ☆14Updated 3 years ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 5 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• fsestini / tt-in-cubical
  Type Theory in Type Theory using Cubical Agda
  ☆12Updated 6 years ago
• taktoa / wasm-agda
  A typechecker for WebAssembly, written in Agda (WIP)
  ☆17Updated 7 years ago
• Avi-D-coder / sundial-gc-design
  type safe, concurrent, pauseless, copying, generational GC. Implementation https://github.com/Avi-D-coder/sundial-gc
  ☆30Updated 4 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 3 months ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• hydrolarus / toml-idr
  A TOML parser for Idris 2
  ☆15Updated 9 months ago
• Blaisorblade / dot-iris
  Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization
  ☆31Updated last week
• pwrobinson / concurrent-hashtable
  A thread-safe hash table in Haskell
  ☆15Updated 5 years ago
• rudymatela / express
  Dynamically-typed Haskell expressions involving applications and variables.
  ☆22Updated 2 months ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• ollef / dependent-hashmap
  Dependent hash maps
  ☆14Updated 10 months ago
• xnning / Row-and-Bounded-via-Disjoint
  Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.
  ☆13Updated 4 years ago
• hubris-lang / hubris
  A dependently typed programming language, and verification tool
  ☆26Updated 8 years ago
• Bodigrim / chimera
  Lazy infinite compact streams with cache-friendly O(1) indexing and applications for memoization
  ☆59Updated 2 months ago
• llvm-hs / llvm-hs-typed
  Type Safe LLVM IR ( Experimental )
  ☆49Updated 6 years ago
• sinelaw / hmf
  A copy of Daan Leijen's reference implementation of HMF (type inference)
  ☆16Updated 8 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆28Updated 4 years ago
• inanna-malick / mononoke
  Toy version of Git/Mercurial built using recursion schemes. Implements lazy diffing and merging of merkle dir trees. Solves toy versions …
  ☆3Updated 3 years ago
• gelisam / hyzzy
  A framework for defining text adventures via Haskell files. Play by combining functions, not by guessing phrases.
  ☆32Updated 4 years ago
• JoeyEremondi / lambda-pi-constraint
  ☆16Updated last month
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated 5 months ago
• re-xyr / speff
  Fast higher-order effect handlers with evidence passing
  ☆19Updated last year
• atennapel / qtt-ts
  Implementation of Quantitative Type Theory (in TypeScript)
  ☆12Updated 4 years ago
• typesanitizer / edit
  Edit is a monad for rewriting things.
  ☆23Updated 4 years ago