Alternatives and similar repositories for ski-in-asm

Users that are interested in ski-in-asm are comparing it to the libraries listed below

• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 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
• 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
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated last month
• gelisam / typechecker-combinators
  ☆17Updated last year
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 7 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• obfusk / koneko
  koneko - a concatenative not-quite-lisp for kittens
  ☆23Updated 9 months ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆35Updated 7 months ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• SjVer / Lamb
  An implementation of Colin James' "Compiling Lambda Calculus"
  ☆16Updated 2 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 3 months ago
• mb64 / poly
  A WIP compiler for a functional language. Very incomplete!
  ☆16Updated 3 years ago
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆20Updated 8 months ago
• siraben / r5rs-denot
  A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.
  ☆21Updated 2 weeks ago
• thery / hanoi
  Hanoi tower in Coq
  ☆26Updated last week
• iambrj / metaKanren
  Relational interpreter for miniKanren, in miniKanren.
  ☆14Updated 3 years ago
• hanleyc01 / rkttt
  ☆12Updated last year
• adrieng / pulsar
  Experimental functional language
  ☆17Updated 2 years ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆29Updated this week
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 9 years 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
• acorrenson / modulus
  A constraint solver built from scratch in OCaml
  ☆11Updated 3 years ago
• reynir / Brainfuck
  Brainfuck formalized in Coq
  ☆26Updated 3 years ago