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:
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Bologna Optimal Higher-Order Machine, Version 1.1☆73Updated 8 years ago
- Standard library for the Formality language☆18Updated 5 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆53Updated 5 months ago
- ☆36Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated 9 months ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆34Updated last month
- A minimal proof checker.☆75Updated 10 months ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆68Updated 3 years ago
- A collection of programming languages and type systems.☆33Updated 2 months ago
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 3 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Formality in itself☆20Updated 4 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆141Updated 6 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 4 months ago
- Refinement types + dependent types = ❤️☆58Updated 2 years ago
- A programming language somewhat resembling cellular processes.☆34Updated 3 years ago
- The Makam Metalanguage☆198Updated 2 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- A WIP little dependently-typed systems language☆41Updated 11 months ago
- Collection of Kind2 programs and proofs☆12Updated last year
- An upcoming operating system built on Type-Theory☆43Updated 5 years ago
- Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.☆114Updated 8 years ago
- Ordo: A minimalist language with row polymorphism☆82Updated 3 months ago
- The Next Generation of Compositional Programming☆52Updated 3 weeks ago