LPTK / simple-subLinks
Alternative algorithm for algebraic subtyping.
☆170Updated 3 weeks ago
Alternatives and similar repositories for simple-sub
Users that are interested in simple-sub are comparing it to the libraries listed below
Sorting:
- Staged compilation with dependent types☆184Updated 6 months ago
- A simple ML-like programming language with subtyping and full type inference.☆183Updated last year
- A compiler for functional programs on serialized data☆172Updated last week
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Updated 2 months ago
- Dependent type checker using normalisation by evaluation☆269Updated last year
- The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…☆212Updated last week
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆48Updated 11 months ago
- A bidirectional type checker☆66Updated 8 years ago
- Prototype type inference engine☆204Updated 10 months ago
- ☆90Updated 4 years ago
- The Makam Metalanguage☆197Updated 2 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆101Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- 1ML prototype interpreter☆289Updated 5 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆143Updated 6 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆65Updated 2 weeks ago
- Robust multi-prompt delimited control and effect handlers in C/C++☆129Updated 2 years ago
- Pure functional programming with whole-program mutability inference☆78Updated 4 months ago
- A language with dependent data and codata types☆126Updated this week
- A pure type system implemented in OCaml☆78Updated 4 years ago
- a proof-of-concept programming language based on call-by-push-value☆59Updated 2 weeks ago
- Build system☆131Updated last month
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆134Updated 5 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆75Updated 3 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- Horn Clause Constraint Solving for Liquid Types☆155Updated this week
- A deterministic parser with fused lexing☆74Updated 2 years ago
- Dependently-typed lambda calculus, Mini-TT, extended and implemented in Rust☆120Updated 5 years ago
- being an operating system for typechecking processes☆130Updated last month