Alternatives and similar repositories for parsimony

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

• stephenrkell / libcrunch
  A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.
  ☆104Updated 9 months ago
• jeffreykegler / old_kollos
  The Kollos project [ARCHIVED]
  ☆30Updated 2 years ago
• gregr / ina
  experimental computational medium and supporting tools
  ☆22Updated this week
• djspiewak / derivative-combinators
  An implementation of derivative parsing in the parser combinator framework
  ☆59Updated 14 years ago
• soney / interstate
  ☆53Updated 4 years ago
• ilyasergey / monadic-cfa
  Generic implementation of different CFA families based on monadic decomposition
  ☆21Updated 12 years ago
• jamesbornholt / ocelot
  A synthesis-enabled solver for relational logic
  ☆27Updated 7 years ago
• cheery / chartparser
  Chart parser (Earley SPPF)
  ☆27Updated 6 years ago
• melvinzhang / maru
  A compiler to IA32 and REPL for maru in maru under 7k s-expressions
  ☆16Updated 5 years ago
• mikesperber / pgg
  The PGG Partial Evaluation System for Scheme 48
  ☆18Updated 12 years ago
• 8c6794b6 / guile-tjit
  Guile with tracing JIT VM.
  ☆15Updated 8 years ago
• bordaigorl / stargazer
  A simulator for visualising the evolution of π-calculus terms
  ☆42Updated 3 years ago
• webyrd / cool-relational-interpreter-examples
  Fun, interesting, and thought-provoking examples of relational Scheme interpreters at work
  ☆14Updated 10 years ago
• silentbicycle / hopscotch
  An implementation of Tarjan's Strongly Connected Components algorithm
  ☆13Updated 5 years ago
• softdevteam / eco
  Editor for language composition
  ☆58Updated 2 years ago
• catwell / datalog.lua
  A datalog implementation in pure Lua (LPEG parser).
  ☆22Updated 2 years ago
• srikumarks / FD.js
  Finite domain constraint programming library in JS
  ☆62Updated 3 years ago
• NVIDIA / remorac
  ☆38Updated 9 years ago
• fisherdj / miniAdapton
  a minimal implementation of incremental computation in Scheme
  ☆35Updated 8 years ago
• dvanhorn / oaam
  Optimizing Abstract Abstract Machines
  ☆31Updated 8 years ago
• justinpombrio / synless
  Synless is a language-agnostic tree editor.
  ☆21Updated 2 months ago
• stevenbagley / metaii
  Common lisp implementation of Val Schorr's Meta-II language
  ☆18Updated 8 years ago
• progranet / OMeta.Lua
  OMeta for Lua
  ☆13Updated 4 years ago
• cwearl / fulmar
  Generate formatted C++ from Racket S-expressions
  ☆36Updated 9 years ago
• namin / pink
  Collapsing Towers of Interpreters (in Scheme)
  ☆57Updated 6 years ago
• miniKanren / sokuza-kanren
  Oleg Kiselyov's minimal implementation of logic programming
  ☆23Updated 12 years ago
• CJex / ydiff
  a structural comparison tool for Lisp
  ☆11Updated 11 years ago
• stamourv / partial-evaluation-tutorial
  Racket implementation of Cook and Lämmel's partial evaluation tutorial.
  ☆31Updated 12 years ago
• takeoutweight / bidirectional
  Complete and Easy Bidirectional Typechecking for for Higher-Rank Polymorphism in Clojure
  ☆23Updated 9 years ago
• gregr / dbKanren
  Kanren with databases
  ☆43Updated 10 months ago