Alternatives and similar repositories for simpler-sub:

Users that are interested in simpler-sub are comparing it to the libraries listed below

• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated last month
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆15Updated 11 months ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• AshleyYakeley / Truth
  Changes and Pinafore projects. Pull requests not accepted.
  ☆33Updated this week
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated last year
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆45Updated 2 months ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆28Updated 2 weeks ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆58Updated last year
• mb64 / prolog
  A simple prolog implementation in Rust
  ☆26Updated 4 years ago
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆15Updated 4 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• hkust-taco / mlstruct
  Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"
  ☆39Updated 4 months ago
• balint99 / sfpl
  A simple functional programming language.
  ☆21Updated 3 years ago
• elpinal / modules-rs
  An interpreter of F-ing modules
  ☆19Updated 5 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆29Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• phase / dtt
  dependent type theory experiment
  ☆26Updated last year
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆28Updated this week
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 5 months ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated last year
• ziman / idris2-mlf
  Malfunction backend for Idris 2
  ☆12Updated 3 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆46Updated 5 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated last month
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• atennapel / qtt-ts
  Implementation of Quantitative Type Theory (in TypeScript)
  ☆12Updated 4 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• xnning / Row-and-Bounded-via-Disjoint
  Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.
  ☆13Updated 4 years ago