ayazhafiz / pltsLinks
A collection of programming languages and type systems.
☆33Updated 6 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☆61Updated 2 weeks ago
- SKI combinators☆55Updated 8 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- A bidirectional type checker☆66Updated 8 years ago
- A custom parser/auto-formatter for Standard ML☆83Updated 2 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
- Playing with type systems☆51Updated 10 months ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- ☆89Updated 4 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- ☆16Updated 3 years ago
- A compiler for the gradually typed lambda calculus☆76Updated 4 years ago
- A toy language based on LLVM that implements the System Fω type-system☆112Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- The Makam Metalanguage☆200Updated 2 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆45Updated 10 months ago
- ☆44Updated 3 years ago
- Ordo: A minimalist language with row polymorphism☆85Updated 7 months ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A deterministic parser with fused lexing☆73Updated 2 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆143Updated 6 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- The Next Generation of Compositional Programming☆54Updated 2 months ago
- Alternative algorithm for algebraic subtyping.☆170Updated last month
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆75Updated 3 years ago
- SML reference interpreter☆119Updated 3 weeks ago