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:
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆45Updated 10 months ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆61Updated this week
- a self-hosting lambda calculus compiler☆37Updated 6 months ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- ☆16Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated last year
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 5 years ago
- A simple prolog implementation in Rust☆26Updated 4 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆99Updated 3 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated last week
- A WIP little dependently-typed systems language☆41Updated last year
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- Fωμ type checker and compiler☆54Updated 2 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A small example of a source->source pattern matching to decision tree compiler☆14Updated 5 years ago
- A toy dependent typed language.☆32Updated this week
- A pure type system implemented in OCaml☆77Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- The Next Generation of Compositional Programming☆54Updated last month
- ☆35Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Generation of abstract binding trees☆27Updated 3 weeks ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆51Updated 9 months ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆29Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Accompanying materials for "A Core Calculus for Documents"☆34Updated 2 years ago