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☆76Updated 8 years ago
- Kempe is a compiled stack-based language☆58Updated 11 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- ☆36Updated 3 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆60Updated last month
- Standard library for the Formality language☆18Updated 5 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated last week
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A minimal proof checker.☆75Updated last year
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 3 years ago
- Macro Lambda Calculus☆50Updated 6 years ago
- Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.☆115Updated 8 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.☆142Updated 6 years ago
- ☆35Updated 7 years ago
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- A bidirectional type checker☆63Updated 8 years ago
- The Makam Metalanguage☆199Updated 2 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 6 months ago
- source code for the bondi programming language☆41Updated 6 years ago
- Collection of Kind2 programs and proofs☆12Updated last year
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- An upcoming operating system built on Type-Theory☆43Updated 5 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- GPU-based interaction nets evaluator☆16Updated 13 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆132Updated 5 years ago
- Macros have types!☆131Updated 2 years ago
- SKI combinators☆55Updated 8 years ago