Alternatives and similar repositories for simpler-sub

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

• AshleyYakeley / Truth
  Changes and Pinafore projects. Pull requests not accepted.
  ☆33Updated this week
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 2 months ago
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆15Updated last year
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆50Updated 3 months ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆28Updated last week
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆15Updated 5 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• hkust-taco / mlstruct
  Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"
  ☆39Updated 5 months ago
• xnning / Row-and-Bounded-via-Disjoint
  Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.
  ☆13Updated 5 years ago
• balint99 / sfpl
  A simple functional programming language.
  ☆21Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• elpinal / modules-rs
  An interpreter of F-ing modules
  ☆19Updated 5 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• atennapel / qtt-ts
  Implementation of Quantitative Type Theory (in TypeScript)
  ☆12Updated 4 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated last year
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 3 months ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆30Updated 4 years ago
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆98Updated 2 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆36Updated last year
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆59Updated last year
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆29Updated this week