LPTK / simple-sub
Alternative algorithm for algebraic subtyping.
☆161Updated last month
Alternatives and similar repositories for simple-sub:
Users that are interested in simple-sub are comparing it to the libraries listed below
- A simple ML-like programming language with subtyping and full type inference.☆172Updated 5 months ago
- Staged compilation with dependent types☆171Updated 2 weeks ago
- Prototype type inference engine☆201Updated 3 months ago
- Dependent type checker using normalisation by evaluation☆260Updated 8 months ago
- A compiler for functional programs on serialized data☆163Updated this week
- The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…☆187Updated this week
- A Language with Dependent Data and Codata Types☆102Updated this week
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆147Updated last year
- A bidirectional type checker☆63Updated 7 years ago
- The Makam Metalanguage☆198Updated 2 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 2 years ago
- 1ML prototype interpreter☆282Updated 4 years ago
- Spartan type theory☆265Updated 11 months ago
- 😎TT☆226Updated last year
- Robust multi-prompt delimited control and effect handlers in C/C++☆117Updated last year
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆208Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- Dependently-typed lambda calculus, Mini-TT, extended and implemented in Rust☆119Updated 4 years ago
- Embeddable Lambda Prolog Interpreter☆310Updated this week
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- A deterministic parser with fused lexing☆72Updated last year
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Frank compiler☆290Updated last year
- Contextual types meet mechanized metatheory!☆188Updated 9 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Hindley-Milner Type Inference implemented in (although not for) Python.☆94Updated 3 years ago
- ☆90Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆222Updated last year