LPTK / simple-subLinks
Alternative algorithm for algebraic subtyping.
☆170Updated last week
Alternatives and similar repositories for simple-sub
Users that are interested in simple-sub are comparing it to the libraries listed below
Sorting:
- Dependent type checker using normalisation by evaluation☆265Updated 11 months ago
- Staged compilation with dependent types☆179Updated 3 months ago
- A compiler for functional programs on serialized data☆167Updated 2 months ago
- The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…☆198Updated this week
- A simple ML-like programming language with subtyping and full type inference.☆179Updated 8 months ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆148Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- Prototype type inference engine☆204Updated 6 months ago
- A Language with Dependent Data and Codata Types☆116Updated last week
- ☆90Updated 3 years ago
- The Makam Metalanguage☆199Updated 2 years ago
- A bidirectional type checker☆63Updated 8 years ago
- 1ML prototype interpreter☆286Updated 5 years ago
- Pure functional programming with whole-program mutability inference☆74Updated 3 weeks ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆142Updated 6 years ago
- being an operating system for typechecking processes☆128Updated 2 years ago
- a proof-of-concept programming language based on call-by-push-value☆54Updated this week
- Robust multi-prompt delimited control and effect handlers in C/C++☆124Updated last year
- 😎TT☆231Updated 2 weeks ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆45Updated 5 months ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆41Updated 8 months ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆81Updated 4 years ago
- The Next Generation of Compositional Programming☆52Updated last week
- Build system☆124Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆132Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- ☆53Updated last week
- Frank compiler☆296Updated last year
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆55Updated last week