LPTK / simple-subLinks
Alternative algorithm for algebraic subtyping.
☆174Updated 2 months ago
Alternatives and similar repositories for simple-sub
Users that are interested in simple-sub are comparing it to the libraries listed below
Sorting:
- A compiler for functional programs on serialized data☆174Updated last week
- Staged compilation with dependent types☆187Updated last week
- A simple ML-like programming language with subtyping and full type inference.☆188Updated last year
- Dependent type checker using normalisation by evaluation☆273Updated last year
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Updated 4 months ago
- Prototype type inference engine☆204Updated last year
- The Makam Metalanguage☆199Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆65Updated last year
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆101Updated 3 years ago
- The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…☆213Updated this week
- A bidirectional type checker☆67Updated 8 years ago
- 1ML prototype interpreter☆290Updated 5 years ago
- ☆90Updated 4 years ago
- Horn Clause Constraint Solving for Liquid Types☆157Updated 2 weeks ago
- Robust multi-prompt delimited control and effect handlers in C/C++☆131Updated 2 years ago
- A language with dependent data and codata types☆125Updated this week
- Build system☆134Updated 3 months ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆65Updated 2 months ago
- being an operating system for typechecking processes☆131Updated 4 months ago
- Pure functional programming with whole-program mutability inference☆79Updated last month
- Frank compiler☆304Updated last year
- A comparison of how computational effects and handlers are implemented in various programming languages.☆146Updated 6 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆134Updated 5 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- 😎TT☆241Updated 2 months ago
- Contextual types meet mechanized metatheory!☆206Updated 4 months ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆46Updated 11 months ago
- a proof-of-concept programming language based on call-by-push-value☆61Updated 2 weeks ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆214Updated 3 years ago