Alternatives and similar repositories for minilog

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

• joelburget / lvca
  language verification, construction, and analysis
  ☆20Updated 3 years ago
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆20Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 2 months ago
• cicada-lang / inet-forth
  An implementation of interaction nets as a forth-like language.
  ☆33Updated last month
• elpinal / subtyping-agda
  Some rudimentary proofs on subtyping
  ☆11Updated 3 years ago
• eviefp / logic-in-haskell
  Classical Logic in Haskell
  ☆24Updated 2 months ago
• cdfa / frugel
  An error-tolerant live programming environment (my Master's thesis)
  ☆18Updated 2 years ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆29Updated this week
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• 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
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• Soonad / Base.fm
  Standard library for the Formality language
  ☆18Updated 5 years ago
• acorrenson / owl
  A mini language for logic programming
  ☆24Updated 5 years ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆15Updated last year
• 4y8 / esoo
  Like the Programming Languages Zoo but with esoteric languages.
  ☆25Updated 5 years ago
• craff / pacomb
  A parsing library that compiles grammars to combinators using elimination of left recursion
  ☆22Updated last year
• hydrolarus / cytosol
  A programming language somewhat resembling cellular processes.
  ☆34Updated 3 years ago
• hellerve / microml
  A minimal ML, type-inferred, compiled, and/or interpreted in less than 750 lines
  ☆36Updated 5 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆29Updated 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…
  ☆26Updated 2 years ago
• iambrj / metaKanren
  Relational interpreter for miniKanren, in miniKanren.
  ☆14Updated 3 years ago
• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 10 years ago
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆28Updated 4 months ago
• cyberglot / faeth
  algebraic typechecking and elaboration of type systems
  ☆12Updated 4 months ago
• kyledewey / typed-prolog
  A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.
  ☆29Updated 7 years ago