Alternatives and similar repositories for simpler-sub

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

• 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
  ☆47Updated 3 years ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆54Updated 5 months ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆16Updated 5 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆36Updated 4 months ago
• AshleyYakeley / Truth
  Changes and Pinafore projects. Pull requests not accepted.
  ☆34Updated 2 months ago
• hkust-taco / mlstruct
  Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"
  ☆40Updated 7 months ago
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆98Updated 3 years ago
• yzyzsun / CP-next
  The Next Generation of Compositional Programming
  ☆52Updated last month
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated 10 months ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆31Updated this week
• owo-lang / narc-rs
  (WIP) Dependently-typed programming language with Agda style dependent pattern matching
  ☆81Updated 4 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• cuplv / iodyn-lang.rust
  IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections
  ☆15Updated 7 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• mb64 / prolog
  A simple prolog implementation in Rust
  ☆26Updated 4 years ago
• LightAndLight / sized-hkts
  Higher kinded polymorphism in a language with unboxed, statically sized datatypes.
  ☆51Updated 6 months ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 4 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆31Updated 4 years ago
• effect-handlers / effect-handlers-bench
  Benchmark repository of polyglot effect handler examples
  ☆26Updated 3 months ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• eashanhatti / konna
  ☆16Updated 3 years ago
• phase / dtt
  dependent type theory experiment
  ☆26Updated last year
• SomewhatML / sml-analyzer
  An experimental language server for SomewhatML
  ☆24Updated 2 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• naalit / durin
  the Dependent Unboxed higher-oRder Intermediate Notation
  ☆14Updated 3 years ago
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 4 months ago