Alternatives and similar repositories for PomPom-Language

Users that are interested in PomPom-Language are comparing it to the libraries listed below

• liamoc / holbert
  A graphical interactive proof assistant designed for education
  ☆169Updated 11 months ago
• ehatti / peridot
  A fast functional language based on two level type theory
  ☆391Updated 2 years ago
• blynn / compiler
  The adventures of a Haskell compiler
  ☆232Updated 5 months ago
• jameshaydon / lawvere
  A categorical programming language with effects
  ☆284Updated 2 years ago
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆269Updated last year
• barry-jay-personal / tree-calculus
  Proofs in Coq for the book Reflective Programs in Tree Calculus
  ☆180Updated 4 years ago
• andrejbauer / spartan-type-theory
  Spartan type theory
  ☆271Updated last month
• astampoulis / makam
  The Makam Metalanguage
  ☆199Updated 2 years ago
• rossberg / 1ml
  1ML prototype interpreter
  ☆288Updated 5 years ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆183Updated 5 months ago
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆172Updated this week
• gelisam / klister
  an implementation of stuck macros
  ☆146Updated 3 weeks ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆77Updated 8 years ago
• engboris / stellogen
  An experimental language exploring computation and meaning through term unification, with logic-agnostic types.
  ☆114Updated this week
• LPCIC / elpi
  Embeddable Lambda Prolog Interpreter
  ☆329Updated last week
• jmorag / mcc
  MicroC example compiler for Stephen Edward's PLT class, but in Haskell
  ☆119Updated 4 years ago
• frank-lang / frank
  Frank compiler
  ☆300Updated last year
• jozefg / pcf
  A small compiler for PCF
  ☆127Updated 4 years ago
• cedille / cedille
  Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
  ☆384Updated last year
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 4 months ago
• sam46 / Paskell
  A Pascal to LLVM compiler in Haskell
  ☆124Updated 5 years ago
• stchang / macrotypes
  ☆137Updated 3 years ago
• stepchowfun / proofs
  My personal repository of formally verified mathematics.
  ☆305Updated last week
• marvinborner / bruijn
  Programming with pure lambda calculus
  ☆127Updated last week
• githwxi / ATS-Xanadu
  Bootstrapping ATS3
  ☆230Updated last week
• wilbowma / pl-thesaurus
  ☆89Updated 4 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• inpla / inpla
  Inpla: Interaction nets as a programming language (the current version)
  ☆311Updated 11 months ago
• CMU-HoTT / scott
  Selected Papers of Dana S. Scott
  ☆165Updated last year
• TwoFX / sudoku
  A sudoku game where you have to prove that your deductions are valid
  ☆116Updated 3 years ago