ayazhafiz / pltsLinks
A collection of programming languages and type systems.
☆33Updated 2 months ago
Alternatives and similar repositories for plts
Users that are interested in plts are comparing it to the libraries listed below
Sorting:
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆54Updated 5 months ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 6 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- A bidirectional type checker☆63Updated 8 years ago
- SKI combinators☆55Updated 8 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Playing with type systems☆51Updated 7 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A toy language based on LLVM that implements the System Fω type-system☆111Updated last year
- ☆90Updated 3 years ago
- A custom parser/auto-formatter for Standard ML☆79Updated 2 months ago
- The Makam Metalanguage☆198Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 3 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆74Updated 8 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆141Updated 6 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆40Updated 7 months ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆72Updated 3 years ago
- Ordo: A minimalist language with row polymorphism☆82Updated 3 months ago
- Demo for dependent types + runtime code generation☆69Updated 5 months ago
- source code for the bondi programming language☆40Updated 6 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A prototype programming language for programming with runners☆91Updated 3 years ago