Alternatives and similar repositories for flunct

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

• jkoppel / ecta
  ☆35Updated last year
• yzyzsun / CP-next
  The Next Generation of Compositional Programming
  ☆52Updated this week
• mthom / scryer-shen
  ☆53Updated last month
• Racket-Cookbooks / Plot-cookbook
  Plot Cookbook
  ☆50Updated 2 years ago
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆32Updated 6 years ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 4 years ago
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆25Updated 11 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆24Updated last year
• SMLFamily / BasisLibrary
  Repository and Wiki for enriching the Standard ML Basis Library
  ☆62Updated 3 years ago
• ianthehenry / ocamlsyntax.com
  How do you do that recursive GADT thing again?
  ☆28Updated last year
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 2 months ago
• e-wrks / edh
  Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++
  ☆28Updated last year
• janestreet / re2
  OCaml bindings for RE2
  ☆47Updated last month
• SomewhatML / sml-analyzer
  An experimental language server for SomewhatML
  ☆24Updated 2 years ago
• sordina / japl
  Font for turning J into APL
  ☆13Updated 6 years ago
• granstrom / intuitionistic
  Automatically exported from code.google.com/p/intuitionistic
  ☆31Updated 10 years ago
• alt-romes / reference-counting
  Reference counting with linear types
  ☆31Updated 11 months ago
• kyledewey / typed-prolog
  A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.
  ☆29Updated 7 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 6 years ago
• reynir / Brainfuck
  Brainfuck formalized in Coq
  ☆26Updated 3 years ago
• lexi-lambda / racket-mvar
  An implementation of Haskell’s MVars in Racket
  ☆29Updated 8 months ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆53Updated 4 months ago
• yallop / ocaml-re-nfa
  OCaml code to construct an NFA from a regular expression
  ☆52Updated 4 years ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆29Updated this week
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 4 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• joelonsql / reason-re-nfa
  ReasonML code to construct an NFA from a regular expression
  ☆24Updated 6 years ago
• siraben / r5rs-denot
  A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.
  ☆21Updated last month
• urweb / upo
  The Ur/Web People Organizer
  ☆30Updated last year
• jackfirth / resyntax
  A Racket refactoring engine
  ☆63Updated this week