Alternatives and similar repositories for GP2:

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

• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆69Updated 7 years ago
• jrslepak / Remora
  Dependently-typed language with Iverson-style implicit lifting
  ☆121Updated 4 years ago
• MITDDC / clu-1976-1989
  A set of files that can be used to create a working version of an early version of the CLU programming language
  ☆36Updated 2 years ago
• rjnw / sham
  A DSL for runtime code generation in racket
  ☆67Updated 2 years ago
• kyledewey / typed-prolog
  A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.
  ☆28Updated 7 years ago
• kragen / peg-bootstrap
  A PEG that compiles itself.
  ☆75Updated 14 years ago
• vmchale / apple
  Apple array system
  ☆66Updated this week
• TiarkRompf / collapsing-towers
  Collapsing Towers of Interpreters
  ☆87Updated last year
• kirkedal / rfun-interp
  Interpreter for the reversible functional language rFun
  ☆36Updated 6 years ago
• ptarau / TypesAndProofs
  Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems
  ☆33Updated 8 months ago
• polux / lambda-diagrams
  Animations of lambda term reduction sequences
  ☆89Updated 6 years ago
• melvinzhang / maru
  A compiler to IA32 and REPL for maru in maru under 7k s-expressions
  ☆16Updated 4 years ago
• namin / lms-black
  purple: compiling a reflective language
  ☆32Updated 4 months ago
• ashton314 / muKanren_reading
  [Mirror] A close reading of the μKanren paper.
  ☆42Updated 2 years ago
• harp-lab / slog-lang1
  Slog 1.0
  ☆38Updated 8 months ago
• fsantanna / dceu
  ☆29Updated 4 months ago
• sergei-romanenko / spsc
  SPSC: A Small Positive Supercompiler
  ☆34Updated 8 months ago
• Soonad / Base.fm
  Standard library for the Formality language
  ☆18Updated 4 years ago
• trith / trith
  A concatenative programming language founded on the unholy trinity of Forth, Lisp and RDF triples.
  ☆70Updated 14 years ago
• zachgk / catln
  A high-level programming language
  ☆38Updated 3 weeks ago
• luqui / Djest
  A programming language that deduces code from tests
  ☆30Updated 7 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆28Updated 5 years ago
• dawn-lang / ucc
  Untyped Concatenative Calculus
  ☆19Updated 3 years ago
• brismu / brismu
  A relational interpretation of Lojban
  ☆33Updated 2 weeks ago
• gregr / dbKanren
  Kanren with databases
  ☆43Updated 6 months ago
• michaelballantyne / syntax-spec
  A metalanguage for creating sophisticated DSLs in Racket.
  ☆28Updated this week
• John-Nagle / nqthm
  nqthm - the original Boyer-Moore theorem prover, from 1992
  ☆50Updated 8 years ago
• woodrush / lambdacraft
  Common Lisp DSL for building untyped lambda calculus expressions
  ☆24Updated 2 months ago
• lf94 / paizo-programmer
  An ergonomic, mobile-first, Prolog playground!
  ☆30Updated 2 years ago
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆49Updated 2 months ago