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!
☆26Updated 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:
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A toy dependent typed language.☆30Updated this week
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆53Updated 5 months ago
- Changes and Pinafore projects. Pull requests not accepted.☆34Updated last month
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆16Updated 5 years ago
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.☆13Updated 5 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆40Updated 6 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- a self-hosting lambda calculus compiler☆35Updated 3 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- dependent type theory experiment☆26Updated last year
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- A simple functional programming language.☆21Updated 4 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Fωμ type checker and compiler☆54Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Benchmarking algebraic effect handler implementations☆26Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- A WIP little dependently-typed systems language☆41Updated 11 months ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago