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☆34Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 3 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
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆14Updated 9 months ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A toy dependent typed language.☆28Updated 2 weeks ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆37Updated 2 months ago
- 🩺 A library for compiler diagnostics☆38Updated last month
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 4 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical types☆27Updated this week
- Fωμ type checker and compiler☆52Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Duo - A research language exploring duality in programming language design☆57Updated last year
- A simple prolog implementation in Rust☆26Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 10 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.☆13Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A simple functional programming language.☆21Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Liquid Types implementation for Rust☆29Updated 2 years ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago