Alternatives and similar repositories for lc-apl

Users that are interested in lc-apl are comparing it to the libraries listed below

• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆20Updated 4 years ago
• obfusk / koneko
  koneko - a concatenative not-quite-lisp for kittens
  ☆24Updated 9 months ago
• cicada-lang / inet-forth
  An implementation of interaction nets as a forth-like language.
  ☆33Updated last month
• marvinborner / BLoC
  File format and optimizer for programs encoded in binary lambda calculus
  ☆14Updated last year
• woodrush / lambdavm
  A programmable virtual CPU written in untyped lambda calculus
  ☆55Updated 2 years ago
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 3 months ago
• StavromulaBeta / emoji-apl
  Like APL, but with emojis
  ☆15Updated 3 years ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• siraben / mini-haskell
  A self-hosting mini Haskell compiler with a mini C runtime.
  ☆76Updated 5 years ago
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆14Updated last year
• lynn / universal-lambda
  A minimal esolang based on lambda calculus
  ☆16Updated 4 years ago
• Buroni / automata-golf
  A domain-specific language (DSL) for parsing regular, context-free and recursively enumerable languages.
  ☆17Updated 2 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• udem-dlteam / mimosa
  Minimal operating system for x86 intended as a basis for benchmarking and running Gambit
  ☆88Updated 4 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• thamugadi / mltt-c
  Martin-Löf type theory + W-types implemented in C (WIP)
  ☆18Updated last month
• kspalaiologos / yarg
  Yet another UNIX-like argument parser for C. CC0-licensed.
  ☆16Updated 6 months ago
• been-jamming / CORE
  A constructive proof assistant for second order logic.
  ☆34Updated 8 months ago
• marvinborner / bruijn
  Programming with pure lambda calculus
  ☆109Updated 2 months ago
• ncihnegn / miranda
  Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…
  ☆57Updated 3 weeks ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆29Updated this week
• SjVer / Lamb
  An implementation of Colin James' "Compiling Lambda Calculus"
  ☆16Updated 2 years ago
• UberPyro / prowl
  WIP stack language that uses regex for control flow
  ☆42Updated last year
• xy-kasumi / hs2bf
  Haskell to brainfuck compiler
  ☆29Updated 11 years ago
• Superstar64 / aith
  [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…
  ☆62Updated last year
• Armael / conch
  ☆24Updated 3 years ago
• tlively / BrainCoqulus
  A formally verified compiler of untyped lambda calculus to brainfuck
  ☆13Updated 7 years ago
• dannypsnl / minic
  Minimalist compiler course, based on Essential of Compilation
  ☆10Updated 10 months ago
• khasm-lang / khasmc
  A functional programming language, mirroring Erlang and Go, but with more OCaml!
  ☆24Updated 3 weeks ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 7 years ago