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
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 7 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆65Updated 6 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆124Updated last year
• grin-compiler / idris-grin
  GRIN backend for Idris
  ☆50Updated 5 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• ChrisPenner / mad-props
  Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.
  ☆67Updated 2 years ago
• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆46Updated 3 months ago
• lexi-lambda / higher-rank
  A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism
  ☆101Updated 8 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆54Updated 4 months ago
• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆56Updated 6 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆75Updated 3 years ago
• themattchan / core
  SPJ's tutorial on implementing functional languages
  ☆29Updated 6 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• atzeus / CTRex
  Open records for Haskell
  ☆22Updated 7 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆53Updated 8 years ago
• gelisam / conway
  Demonstrating comonad transformers.
  ☆37Updated 8 years ago
• pa-ba / McCarthy-Painter
  Coq proof for the paper "Compiling a Fifty Year Journey"
  ☆13Updated 7 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆54Updated last month
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 14 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• agda-attic / agda-frp-js
  ECMAScript back end for Functional Reactive Programming in Agda
  ☆104Updated 7 years ago
• dorchard / type-level-sets
  Type-level sets for Haskell (with value-level counterparts and various operations)
  ☆66Updated last year
• davdar / maam
  A monadic approach to static analysis following the methodology of AAM
  ☆18Updated 9 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• dorchard / codo-notation
  Codo notation for programming with comonads in Haskell
  ☆25Updated 4 years ago
• stepcut / plugins
  Dynamic linking and runtime evaluation of Haskell, and C, including dependency chasing and package resolution.
  ☆53Updated last year
• jfdm / idris-containers
  Various data structures for use in the Idris Language.
  ☆95Updated 5 years ago