Alternatives and similar repositories for MiniKanrenT:

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

• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 6 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 6 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 8 months ago
• dorchard / type-level-sets
  Type-level sets for Haskell (with value-level counterparts and various operations)
  ☆66Updated last year
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆53Updated last week
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 10 years ago
• grin-compiler / idris-grin
  GRIN backend for Idris
  ☆51Updated 5 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆52Updated 7 years ago
• thalerjonathan / gloss-idris
  A port of the gloss library from Haskell to Idris
  ☆22Updated 6 years ago
• dorchard / codo-notation
  Codo notation for programming with comonads in Haskell
  ☆26Updated 4 years ago
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 7 years ago
• gelisam / conway
  Demonstrating comonad transformers.
  ☆37Updated 8 years ago
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆36Updated 4 years ago
• robrix / sequoia
  classical sequent calculus, embedded in Haskell
  ☆20Updated 3 years ago
• davdar / maam
  A monadic approach to static analysis following the methodology of AAM
  ☆18Updated 9 years ago
• Icelandjack / Capabilities
  A Haskell library providing separation of effects on the type level, effectively splitting up the monolithic IO-monad into more limited c…
  ☆27Updated 7 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 7 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆72Updated 3 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 7 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆34Updated last year
• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆43Updated 2 weeks ago
• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆56Updated 5 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 14 years ago
• vmchale / permutations
  Provides a type-safe way of working with permutations in Idris
  ☆35Updated 3 years ago
• david-christiansen / derive-all-the-instances
  Work on type class deriving with elaboration reflection
  ☆32Updated 6 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated last month
• DanBurton / system-f
  System F implemented in Haskell
  ☆24Updated 13 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year