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☆83Updated 8 years ago
- ☆36Updated 4 years ago
- Macro Lambda Calculus☆50Updated 6 years ago
- Kempe is a compiled stack-based language☆58Updated last year
- Standard library for the Formality language☆18Updated 5 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆66Updated last month
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 3 years ago
- A minimal proof checker.☆78Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆62Updated last year
- source code for the bondi programming language☆44Updated 6 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated this week
- This is an implementation of interaction nets, with a familiar JavaScript-like syntax :)☆58Updated 5 months ago
- Collection of Kind2 programs and proofs☆12Updated last year
- The Makam Metalanguage☆198Updated 2 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A collection of programming languages and type systems.☆33Updated 7 months ago
- Ordo: A minimalist language with row polymorphism☆85Updated 8 months ago
- Specification of the Cedille Core language☆34Updated 5 years ago
- ☆119Updated last year
- ☆35Updated 7 years ago
- Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.☆116Updated 8 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆48Updated last year
- a functional programming language with algebraic effects and handlers☆82Updated 10 months ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- The Twelf Programming Language☆147Updated 2 weeks ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆77Updated 3 years ago