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!
☆27Updated 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:
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 5 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆41Updated 8 months ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆55Updated last week
- An experimental language server for SomewhatML☆24Updated 2 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- a self-hosting lambda calculus compiler☆36Updated 4 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated this week
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆81Updated 4 years ago
- The Next Generation of Compositional Programming☆52Updated last week
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- ☆16Updated 3 years ago
- A simple prolog implementation in Rust☆26Updated 4 years ago
- A WIP little dependently-typed systems language☆41Updated last year
- A toy dependent typed language.☆31Updated 2 weeks ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated 10 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last week
- the Dependent Unboxed higher-oRder Intermediate Notation☆14Updated 3 years ago
- source code for the bondi programming language☆40Updated 6 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Playing with type systems☆51Updated 7 months ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year