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!
☆25Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for simpler-sub
- A dependent type theory with user defined data types☆45Updated 3 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆32Updated 2 weeks ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- An experimental language server for SomewhatML☆24Updated last year
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 4 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆14Updated 5 months ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Dependently typed programming language written in Haskell☆22Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆30Updated 2 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆30Updated 4 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 6 months ago
- A pure type system implemented in OCaml☆77Updated 3 years ago
- A simple prolog implementation in Rust☆26Updated 4 years ago
- A template for you to implement Hazelnut yourself☆19Updated last month
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- dependently-typed lisp with flexible compiler backends☆25Updated 5 years ago
- A simple functional programming language.☆21Updated 3 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆92Updated 2 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- Fωμ type checker and compiler☆51Updated last year
- An interpreter of F-ing modules☆18Updated 5 years ago
- A collection of programming languages and type systems.☆33Updated 3 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated last month
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 3 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.☆13Updated 4 years ago