Alternatives and similar repositories for mccarthy-to-bryant

Users that are interested in mccarthy-to-bryant are comparing it to the libraries listed below

• darius / toot
  A small language to demo turning an interpreter into a compiler
  ☆11Updated 9 years ago
• kmcallister / qoppa
  Metacircular evaluator for a tiny fexpr language
  ☆44Updated 13 years ago
• seantalts / hasktrip
  Datalog implementation in Haskell. Experimental proving ground for knowledge-base ideas.
  ☆23Updated 7 years ago
• webyrd / linear-logic-multiset-rewriting
  Logic for story telling!
  ☆36Updated 7 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• pietervdvn / ALGT2
  ALGT 2.0
  ☆30Updated 6 years ago
• evincarofautumn / Ward
  A static analysis tool for C.
  ☆28Updated 6 years ago
• darius / cogen
  Compiler generator (3rd Futamura projection) for first-order Scheme
  ☆13Updated 9 years ago
• sto0pkid / CategoryTheory
  Category Theory in Agda
  ☆13Updated 7 years ago
• kyagrd / tiper
  Type Inference Prototyping Engine from Relational specifications of type systems
  ☆11Updated 5 years ago
• chrisamaphone / ml-mukanren
  microkanren in sml
  ☆27Updated 10 years ago
• mndrix / microkanren-prolog
  Prolog implementation of microKanren
  ☆44Updated 10 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆31Updated 2 years ago
• melted / idris-chez
  An idris backend compiling to chez scheme
  ☆48Updated 8 years ago
• clf / celf
  ☆62Updated 6 years ago
• michaelballantyne / meta-minikanren
  A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!
  ☆23Updated 9 years ago
• synergistics / chemlambda-hask
  A set of tools for building graph rewriting systems and more specifically, working with the chemlambda rewrite model of computation.
  ☆12Updated 9 years ago
• chrisdone-archive / ats-examples
  Examples from Introduction to Programming in ATS
  ☆26Updated 11 years ago
• acharal / hopes
  Higher Order Prolog with Extensional Semantics
  ☆53Updated 5 years ago
• thoughtpolice / asc
  Austin's supercompiler work
  ☆21Updated 6 years ago
• UnkindPartition / prover
  Simple lambda prover
  ☆24Updated 10 years ago
• pigworker / shonky
  being some experiments, working towards some equipment I wish I had
  ☆37Updated 9 years ago
• jrslepak / Remora
  Dependently-typed language with Iverson-style implicit lifting
  ☆126Updated 5 years ago
• jozefg / hm
  A small implementation of type inference
  ☆80Updated 10 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆66Updated 2 months ago
• soupi / pureli
  A purely functional, dynamically typed, parallel evaluated Lisp-like programming language
  ☆35Updated 9 years ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 8 years ago
• ilya-klyuchnikov / henk
  Pure Type Systems for Functional Programming
  ☆31Updated 5 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆36Updated last year