WebAssembly / tail-callLinks
Proposal to add tail calls to WebAssembly
☆114Updated 9 months ago
Alternatives and similar repositories for tail-call
Users that are interested in tail-call are comparing it to the libraries listed below
Sorting:
- Javascript implementation of "Complete and Easy Bidirectional Type Checking for Higher-Rank Polymorphism"☆79Updated last year
- Macros have types!☆134Updated 2 years ago
- Type Inference Library written in TypeScript☆93Updated 2 years ago
- Kempe is a compiled stack-based language☆58Updated last year
- A repository for the stack switching proposal.☆182Updated last month
- Proposal to add multi-values to WebAssembly☆75Updated 4 years ago
- A minimal pure functional language based on self dependent types.☆73Updated 3 years ago
- Fungi: Typed incremental computation with names☆71Updated 6 years ago
- A compiler from WebAssembly to native code, via the OCaml backend.☆92Updated 7 years ago
- Standard library for the Formality language☆18Updated 5 years ago
- Dependent JavaScript: A Typed Dialect☆87Updated 12 years ago
- ☆36Updated 4 years ago
- WebAssembly Code Generation Backend for Idris Compiler☆82Updated 7 years ago
- Implementing the type system described in the paper "Complete and Easy Bidirectional Type Inference" in Rust☆46Updated 9 years ago
- The Yatima Standard Library☆20Updated 2 years ago
- A programming language somewhat resembling cellular processes.☆34Updated 3 years ago
- Frank compiler☆302Updated last year
- Implementation of "practical type inference for arbitrary-rank types" in Javascript☆12Updated 6 years ago
- Algebraic effects in javascript with scoped handlers, multishot delimited continuations, stack safety, do notation and higher-order effec…☆108Updated 3 years ago
- Code and demos for Reconstructing TypeScript blog posts.☆35Updated 2 years ago
- ☆37Updated 4 years ago
- Formality in itself☆20Updated 5 years ago
- Plasma Programming Language☆167Updated 7 months ago
- Proposal for Type Imports & Exports☆23Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- A minimal proof language.☆211Updated 6 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆143Updated 6 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆101Updated 3 years ago
- Thoughts and stuff☆70Updated 5 years ago
- PROTOTYPE: A minimal scripting language - OOP via lambda functions and pattern matching☆54Updated 8 years ago