Alternatives and similar repositories for eco

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

• combinatorylogic / mbase
  Metaprogramming framework for .net
  ☆91Updated 5 years ago
• namin / lms-black
  purple: compiling a reflective language
  ☆33Updated last year
• TiarkRompf / collapsing-towers
  Collapsing Towers of Interpreters
  ☆92Updated 5 months ago
• daniel-kun / omni
  The Omni Programming Language
  ☆34Updated 7 years ago
• jrslepak / Remora
  Dependently-typed language with Iverson-style implicit lifting
  ☆126Updated 5 years ago
• stchang / macrotypes
  ☆137Updated 3 years ago
• aliceml / aliceml
  A functional programming language based on Standard ML, extended with support for concurrent, distributed, and constraint programming
  ☆219Updated 3 years ago
• mit-plv / timl
  TiML: A Functional Programming Language with Time Complexity
  ☆80Updated 8 years ago
• dvanhorn / redex-aam-tutorial
  An Introduction to Redex with Abstracting Abstract Machines
  ☆104Updated last year
• namin / staged-miniKanren
  multi-stage relational programming for staged relational interpreters: running with holes, faster
  ☆137Updated this week
• melted / idris-chez
  An idris backend compiling to chez scheme
  ☆48Updated 8 years ago
• samrushing / irken-compiler
  Irken is a statically typed variant of Scheme. Or a lisp-like variant of ML.
  ☆213Updated 2 years ago
• techcentaur / Krivine-Machine
  Abstract krivine machine implementing call-by-name semantics. In OCaml.
  ☆45Updated 7 years ago
• TiarkRompf / lancet
  surgical precision JIT compilers
  ☆122Updated 8 years ago
• acharal / hopes
  Higher Order Prolog with Extensional Semantics
  ☆53Updated 5 years ago
• gregr / icfp2017-artifact-auas7pp
  ICFP 2017 Artifact for Functional Pearl: A Unified Approach to Solving Seven Programming Problems
  ☆29Updated 7 years ago
• fare / moll
  My Own Linear Lisp
  ☆42Updated 7 years ago
• boomerang-lang / boomerang
  The Boomerang Bidirectional Programming Language
  ☆77Updated 2 years ago
• John-Nagle / nqthm
  nqthm - the original Boyer-Moore theorem prover, from 1992
  ☆56Updated 9 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆173Updated 7 years ago
• djspiewak / derivative-combinators
  An implementation of derivative parsing in the parser combinator framework
  ☆59Updated 15 years ago
• jozefg / hm
  A small implementation of type inference
  ☆80Updated 10 years ago
• deech / ATS-Strange-Loop-Talk
  ☆47Updated 8 years ago
• namin / clpsmt-miniKanren
  CLP(SMT) on top of miniKanren
  ☆38Updated 3 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆49Updated 11 years ago
• jeffreykegler / old_kollos
  The Kollos project [ARCHIVED]
  ☆30Updated 3 years ago
• webyrd / hindley-milner-type-inferencer
  Relational Hindley-Milner type inferencer in miniKanren. Supports polymorphic 'let'. Performs type habitation.
  ☆21Updated 10 years ago
• bor0 / gidti
  Book: Introduction to Dependent Types with Idris
  ☆78Updated 2 years ago
• iguana-parser / iguana
  prototype parser run-time, back-end for different kinds of parser generators, including rascal.
  ☆53Updated 5 months ago
• nanopass / nanopass-framework-racket
  nanopass compiler framework for Racket
  ☆195Updated last year