Alternatives and similar repositories for minic

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

• andreypopp / type-systems
  Playing with type systems
  ☆51Updated last year
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆21Updated 2 months ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆20Updated last month
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 4 years ago
• Guest0x0 / trebor
  an implementation of Observational Type Theory (OTT) and more
  ☆30Updated 3 years ago
• acorrenson / modulus
  A constraint solver built from scratch in OCaml
  ☆12Updated 4 years ago
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 10 months ago
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆20Updated 5 years ago
• jfecher / algorithm-j
  A minimal implementation of Hindley-Milner's Algorithm J in OCaml
  ☆77Updated 4 years ago
• RedPRL / asai
  🩺 A library for compiler diagnostics
  ☆52Updated 2 months ago
• ncfavier / agda-stuff
  My Agda blog/lab/playground
  ☆12Updated this week
• lynn / universal-lambda
  A minimal esolang based on lambda calculus
  ☆16Updated 5 years 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
• camllight / camllight
  The Caml Light implementation of the Caml language
  ☆68Updated 2 years ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• ralsei / bingus
  A program synthesizer for code in the How to Design Programs curriculum
  ☆13Updated 2 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• ralsei / six-eyes
  A work-in-progress structure editor for the cooltt proof assistant.
  ☆18Updated 3 years ago
• sorawee / pretty-expressive
  An implementation of "A Pretty Expressive Printer" in Racket
  ☆28Updated last year
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆12Updated last year
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 10 months ago
• Trebor-Huang / vscode-forester
  VSCode support for Forester
  ☆22Updated 2 months ago
• mflatt / shplait
  Based on Plait (based on PLAI Typed, based on PLAI), but in Shrubbery notation
  ☆17Updated last month
• ncihnegn / miranda
  Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…
  ☆65Updated 8 months ago
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆31Updated last year
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆32Updated 2 years ago
• favonia / hdtt2020-notes
  ☆38Updated 4 years ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆61Updated 2 years ago
• SomewhatML / sml-analyzer
  An experimental language server for SomewhatML
  ☆24Updated 3 years ago