Alternatives and similar repositories for MiniKanrenT

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

• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• grin-compiler / idris-grin
  GRIN backend for Idris
  ☆50Updated 5 years ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• ChrisPenner / mad-props
  Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.
  ☆67Updated 3 years ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆128Updated last year
• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆45Updated 8 months ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 7 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆54Updated this week
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• Helium4Haskell / helium
  The Helium compiler, Helium-as-a-library, and the texthint interpreter
  ☆98Updated last year
• ndmitchell / uniplate
  Haskell library for simple, concise and fast generic operations.
  ☆82Updated 2 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆125Updated last year
• davdar / maam
  A monadic approach to static analysis following the methodology of AAM
  ☆18Updated 10 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆57Updated last year
• aisamanra / s-cargot
  Elaborate and expressive S-Expression library for Haskell
  ☆65Updated last year
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆55Updated 8 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated 2 years ago
• themattchan / core
  SPJ's tutorial on implementing functional languages
  ☆29Updated 6 years ago
• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆56Updated 6 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆70Updated 2 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 5 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 12 years ago
• aherrmann / simply_llvm
  ☆41Updated 8 years ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆113Updated 2 years ago
• DanBurton / tardis
  ☆110Updated last week
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• mbg / hindley-milner
  Template for Hindley-Milner based languages
  ☆39Updated 4 years ago