Alternatives and similar repositories for supercompilation-resources

Users that are interested in supercompilation-resources are comparing it to the libraries listed below

• fir-lang / fir
  Fir programming language
  ☆91Updated this week
• cu1ch3n / type-inference-zoo
  🦖 Implementations of various type inference algorithms. The new project is now at https://github.com/cu1ch3n/type-inference-zoo-frontend…
  ☆153Updated 7 months ago
• polarity-lang / polarity
  A language with dependent data and codata types
  ☆125Updated last week
• taolson / Admiran
  Admiran is a pure, lazy, functional language and self-hosting compiler based upon Miranda
  ☆85Updated this week
• marvinborner / interaction-net-resources
  Interaction net resources
  ☆43Updated last week
• jsiek / deduce
  A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.
  ☆121Updated 3 weeks ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 11 months ago
• engboris / stellogen
  An experimental language exploring computation and meaning through term unification, with logic-agnostic types.
  ☆124Updated last week
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆187Updated this week
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆65Updated 2 months ago
• blynn / compiler
  The adventures of a Haskell compiler
  ☆237Updated 3 months ago
• marvinborner / bruijn
  Programming with pure lambda calculus
  ☆140Updated last month
• brendanzab / language-garden
  A garden of small programming language implementations 🪴
  ☆310Updated this week
• dunhamsteve / newt
  A toy dependent typed language.
  ☆36Updated this week
• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆174Updated this week
• etiamz / optiscope
  A Lévy-optimal lambda calculus reducer with a backdoor to C
  ☆41Updated this week
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆84Updated 8 years ago
• lexa-lang / lexa
  ☆42Updated 5 months ago
• morphic-lang / morphic
  Pure functional programming with whole-program mutability inference
  ☆79Updated last month
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆271Updated last year
• leanprover / fp-lean
  Functional Programming in Lean
  ☆140Updated last week
• standardml / twelf
  The Twelf Programming Language
  ☆149Updated 2 weeks ago
• Superstar64 / aith
  [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…
  ☆77Updated 2 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆64Updated last year
• shwestrick / smlfmt
  A custom parser/auto-formatter for Standard ML
  ☆87Updated last month
• LPTK / simple-sub
  Alternative algorithm for algebraic subtyping.
  ☆174Updated 2 months ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆79Updated 9 months ago
• hkust-taco / mlscript
  The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…
  ☆213Updated last week
• cronokirby / haskell-in-haskell
  Trying to write an understandable implementation of Haskell, in Haskell
  ☆125Updated 4 years ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆122Updated 8 months ago