HigherOrderCO / FormCoreJSLinks
A minimal pure functional language based on self dependent types.
☆73Updated 3 years ago
Alternatives and similar repositories for FormCoreJS
Users that are interested in FormCoreJS are comparing it to the libraries listed below
Sorting:
- Bologna Optimal Higher-Order Machine, Version 1.1☆77Updated 8 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆61Updated last week
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 3 years ago
- A minimal proof checker.☆75Updated last year
- Standard library for the Formality language☆18Updated 5 years ago
- Kempe is a compiled stack-based language☆58Updated last year
- ☆36Updated 3 years ago
- Macro Lambda Calculus☆50Updated 6 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- a functional programming language with algebraic effects and handlers☆82Updated 7 months ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- A bidirectional type checker☆64Updated 8 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Formality in itself☆20Updated 4 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated 2 weeks ago
- Ordo: A minimalist language with row polymorphism☆85Updated 5 months ago
- ☆119Updated last year
- source code for the bondi programming language☆41Updated 6 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- Implementation of "practical type inference for arbitrary-rank types" in Javascript☆12Updated 6 years ago
- The Makam Metalanguage☆199Updated 2 years ago
- ☆41Updated 4 years ago
- ☆35Updated 7 years ago
- A template for you to implement Hazelnut yourself☆22Updated 2 months ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆143Updated 6 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- ☆16Updated 3 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago