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 6 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆19Updated 5 years ago
• acorrenson / owl
  A mini language for logic programming
  ☆23Updated 5 years ago
• joelburget / lvca
  language verification, construction, and analysis
  ☆20Updated 3 years ago
• cdfa / frugel
  An error-tolerant live programming environment (my Master's thesis)
  ☆19Updated 3 years ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆61Updated 2 weeks 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
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆30Updated this week
• meta-logic / lltp
  TPTP linear logic version
  ☆15Updated 8 months ago
• SjVer / Lamb
  An implementation of Colin James' "Compiling Lambda Calculus"
  ☆16Updated 3 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• andreypopp / type-systems
  Playing with type systems
  ☆51Updated 9 months ago
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆15Updated last year
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated last year
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 3 years ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• contificate / match
  Match compilation algorithm in OCaml
  ☆30Updated 7 months ago
• naalit / pika
  A WIP little dependently-typed systems language
  ☆41Updated last year
• lexi-lambda / blackboard
  A (very) unfinished OpenType Math layout and rendering engine in Racket
  ☆59Updated last year
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 8 months ago
• eashanhatti / konna
  ☆16Updated 3 years ago
• JoeyEremondi / pl-lt-rules
  Rules for writing academic papers and checking them using LTex-ls and LanguageTool
  ☆19Updated 7 months ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• hazelgrove / diy-hazelnut
  A template for you to implement Hazelnut yourself
  ☆22Updated 3 months ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 5 years ago
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆29Updated 9 months ago