Alternatives and similar repositories for minilog

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

• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 5 months ago
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆20Updated 5 years ago
• cdfa / frugel
  An error-tolerant live programming environment (my Master's thesis)
  ☆19Updated 3 years ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 3 years ago
• joelburget / lvca
  language verification, construction, and analysis
  ☆20Updated 3 years ago
• SjVer / Lamb
  An implementation of Colin James' "Compiling Lambda Calculus"
  ☆16Updated 2 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• LPTK / simpler-sub
  Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…
  ☆27Updated 3 years ago
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 6 months ago
• obfusk / koneko
  koneko - a concatenative not-quite-lisp for kittens
  ☆25Updated last year
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆15Updated last year
• jfdm / velo-lang
  Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.
  ☆16Updated 2 years ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆61Updated last week
• meta-logic / lltp
  TPTP linear logic version
  ☆14Updated 7 months ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 7 months ago
• namin / higher-rank
  Practical type inference for arbitrary-rank types
  ☆11Updated 6 years ago
• kyledewey / typed-prolog
  A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.
  ☆30Updated 7 years ago
• glossopoeia / boba
  A general purpose statically-typed concatenative programming language.
  ☆54Updated 2 years ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• SaberVM / FVM
  The Functional Virtual Machine.
  ☆14Updated 9 months ago
• acorrenson / owl
  A mini language for logic programming
  ☆23Updated 5 years ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated 11 months ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆30Updated this week
• eashanhatti / konna
  ☆16Updated 3 years ago
• andreypopp / type-systems
  Playing with type systems
  ☆51Updated 8 months ago
• robertkleffner / wort
  A core concatenative programming language with variables and first-rank polymorphic type inference
  ☆31Updated 5 years ago
• JoeyEremondi / pl-lt-rules
  Rules for writing academic papers and checking them using LTex-ls and LanguageTool
  ☆19Updated 7 months ago
• joes-esolangs / barrel
  An esoteric RPN golfing language
  ☆24Updated 3 years ago