Soonad / FormalityFM
Formality in itself
☆20Updated 4 years ago
Alternatives and similar repositories for FormalityFM:
Users that are interested in FormalityFM are comparing it to the libraries listed below
- ☆36Updated 3 years ago
- ☆35Updated 6 years ago
- A prototype programming language for programming with runners☆88Updated 3 years ago
- Absal ex☆56Updated last year
- An implementation of the Formality language in JavaScript☆72Updated 5 years ago
- An upcoming operating system built on Type-Theory☆43Updated 4 years ago
- A minimal pure functional language based on self dependent types.☆72Updated 2 years ago
- A nano "theorem prover".☆61Updated 5 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Standard library for the Formality language☆18Updated 4 years ago
- Kempe is a compiled stack-based language☆58Updated 3 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Fωμ type checker and compiler☆52Updated last year
- a functional programming language with algebraic effects and handlers☆81Updated 2 years ago
- Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.☆107Updated 7 years ago
- A Haskell implementation of the Formality language☆18Updated 4 years ago
- WebAssembly Code Generation Backend for Idris Compiler☆83Updated 6 years ago
- Example row-polymorphism implementations☆61Updated last year
- A pure type system implemented in OCaml☆77Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆55Updated 8 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated last year
- source code for the bondi programming language☆40Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆81Updated 3 years ago
- A minimal proof language.☆204Updated 5 years ago
- Specification of the Formality proof and programming language☆41Updated last year