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
- A nano "theorem prover".☆62Updated 6 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- A minimal pure functional language based on self dependent types.☆72Updated 2 years ago
- ☆35Updated 6 years ago
- Kempe is a compiled stack-based language☆58Updated 7 months ago
- Absal ex☆57Updated last year
- A prototype programming language for programming with runners☆89Updated 3 years ago
- An implementation of the Formality language in JavaScript☆71Updated 5 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Build system☆123Updated last year
- Specification of the Formality proof and programming language☆41Updated 2 years ago
- Standard library for the Formality language☆18Updated 5 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 3 months ago
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 3 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 2 months ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- An upcoming operating system built on Type-Theory☆43Updated 4 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated this week
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- WebAssembly Code Generation Backend for Idris Compiler☆82Updated 6 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Macro Lambda Calculus☆49Updated 6 years ago
- Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.☆112Updated 7 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- source code for the bondi programming language☆40Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago