effect-handlers / wasm-spec
WebAssembly specification, reference interpreter, and test suite.
☆13Updated last year
Related projects ⓘ
Alternatives and complementary repositories for wasm-spec
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆30Updated 4 months ago
- An experimental language server for SomewhatML☆24Updated last year
- A pure type system implemented in OCaml☆77Updated 3 years ago
- A playground for parsers, type checkers, interpreters, compilers, etc.☆40Updated 5 months ago
- Software Transactional Memory for OCaml☆109Updated last week
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆99Updated last year
- A collection of programming languages and type systems.☆33Updated 3 months ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆133Updated 5 years ago
- A pretty-printing combinator library for OCaml☆47Updated 3 months ago
- Pure functional programming with whole-program mutability inference☆50Updated last week
- SPSC: A Small Positive Supercompiler☆32Updated 6 months ago
- Alternative algorithm for algebraic subtyping.☆149Updated 2 weeks ago
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- Prototype type inference engine☆197Updated 3 months ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 3 years ago
- Fωμ type checker and compiler☆51Updated last year
- Experimental model checker for testing concurrent algorithms☆32Updated 4 months ago
- A mechanisation of Wasm in Coq☆95Updated 2 weeks ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- A prototype programming language for programming with runners☆88Updated 3 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆28Updated last week
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆92Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆30Updated 2 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆25Updated 2 years ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆55Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 6 months ago
- A core language and API for dependently typed languages☆89Updated 11 months ago