Alternatives and similar repositories for hw

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

• dpiponi / SASL
  A simple and educational compiler for the SASL programming language
  ☆23Updated 7 years ago
• trillioneyes / idris-pong
  A browser Pong game, taking advantage of Idris's ability to compile to javascript.
  ☆18Updated 10 years ago
• 8l / asif
  A Self-Interpreter for F-omega
  ☆16Updated 9 years ago
• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 11 years ago
• DIJamner / lambda-compiler
  A simple compiler from the lambda calculus to MIPS assembly
  ☆20Updated 8 years ago
• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆20Updated 4 years ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 8 years ago
• serprex / Rue
  lang Thue + Regex
  ☆15Updated 3 years ago
• felko / snowflake
  An imperative, statically-typed toy language
  ☆12Updated 6 years ago
• Uriopass / Stacklang
  A home-made stack based language heavily inspired from PostScript
  ☆11Updated 5 years ago
• DataKinds / charm
  A [ functional stack ] based language.
  ☆30Updated 2 years ago
• intoverflow / Potential
  x86-64 assembly as a Haskell EDSL
  ☆36Updated 15 years ago
• HackerFoo / peg
  A lazy non-deterministic concatenative programming language
  ☆55Updated 12 years ago
• DataKinds / sixty-five-oh-two
  A 65C02 Assembly eDSL in Haskell
  ☆17Updated 7 years ago
• AHartNtkn / Dependent-Binary-Lambda-Calculus
  A Dependently Typed Esolang
  ☆10Updated 8 years ago
• rain-1 / tarot-compiler
  ☆18Updated 6 years ago
• VictorTaelin / Elementary-Affine-Core-legacy
  A simple, untyped, terminating functional language that is fully compatible with optimal reductions.
  ☆17Updated 6 years ago
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆19Updated 5 years ago
• namin / blond
  the reflective tower Blond by Olivier Danvy & Karoline Malmkjær
  ☆16Updated 5 months ago
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 9 years ago
• helvm / helma
  🔧 🎨 HelMA - Haskellish Esoteric Little Minimal Automaton for Esoteric Languages implemented in Haskell
  ☆15Updated last year
• rocketnia / fexpress
  A compilation-friendly fexpr language. (Proof of concept.)
  ☆23Updated last month
• evincarofautumn / Ward
  A static analysis tool for C.
  ☆28Updated 6 years ago
• hellerve-pl-experiments / microml
  A minimal ML, type-inferred, compiled, and/or interpreted in less than 750 lines
  ☆36Updated 5 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 7 years ago
• orchid-hybrid / minimips
  minikanren mips assembler/disassembler
  ☆33Updated 10 years ago
• jimwhite / treemeta
  A revival of the TREE-META compiler-compiler.
  ☆15Updated 7 years ago
• catseye / Tamsin
  MIRROR of https://codeberg.org/catseye/Tamsin : Somewhere between a meta-language, a programming language, and a rubbish lister
  ☆18Updated last year
• schani / unlambdascheme
  A Scheme to Unlambda compiler
  ☆18Updated 8 years ago
• kwantam / lviv
  stack-based RPN functional programming language
  ☆55Updated 7 years ago