Alternatives and similar repositories for simple-lambda-prolog

Users that are interested in simple-lambda-prolog are comparing it to the libraries listed below

• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 2 months ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• metaocaml / metaocaml-opam
  A repository of MetaOCaml packages
  ☆12Updated 3 weeks ago
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 3 months 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
• adrieng / pulsar
  Experimental functional language
  ☆17Updated 2 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
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆19Updated 4 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• Deducteam / Agda2Dedukti
  ☆19Updated 3 years ago
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 4 years ago
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 2 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
• uemurax / synthetic-topos-theory
  ☆15Updated last year
• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 5 years ago
• peterthiemann / definitional-session
  ☆12Updated 5 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• JacquesCarette / Notes
  ☆13Updated 2 months ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• maxsnew / synthetic-domain-theory
  Experiment with synthetic domain theory in cubical agda
  ☆14Updated 2 years ago
• umazalakain / session-types-coq
  Formalising session types in Coq
  ☆17Updated 5 years ago
• uemurax / morg
  Organize mathematical thoughts
  ☆20Updated last year
• jashug / WhyNotW
  Repository holding code and latex sources for paper "Why Not W?"
  ☆11Updated 4 years ago