LPTK / simpler-sub
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 2 years ago
Alternatives and similar repositories for simpler-sub:
Users that are interested in simpler-sub are comparing it to the libraries listed below
- a self-hosting lambda calculus compiler☆35Updated 2 weeks ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆14Updated 10 months ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆39Updated 4 months ago
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆15Updated 4 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated this week
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆43Updated 2 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A simple prolog implementation in Rust☆26Updated 4 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 5 years ago
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.☆13Updated 4 years ago
- Lua backend for Idris 2☆27Updated 2 years ago
- A toy dependent typed language.☆28Updated last week
- Duo - A research language exploring duality in programming language design☆57Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated 11 months ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A template for you to implement Hazelnut yourself☆21Updated 3 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- ☆12Updated 4 years ago
- A simple functional programming language.☆21Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 4 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆50Updated 2 months ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆19Updated 6 months ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- Setoid type theory implementation☆38Updated last year
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago