LPTK / simpler-subLinks
Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-type-variable constraints. Nevertheless, it's probably enough for what you need!
☆26Updated 3 years ago
Alternatives and similar repositories for simpler-sub
Users that are interested in simpler-sub are comparing it to the libraries listed below
Sorting:
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆52Updated 4 months ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated 2 weeks ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- A toy dependent typed language.☆29Updated this week
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆40Updated 6 months ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆15Updated 5 years ago
- 🩺 A library for compiler diagnostics☆46Updated 4 months ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A template for you to implement Hazelnut yourself☆22Updated 2 weeks ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- A simple functional programming language.☆21Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.☆13Updated 5 years ago
- Demo for dependent types + runtime code generation☆69Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- dependent type theory experiment☆26Updated last year
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago