Soonad / Formality-Core
Specification of the Formality proof and programming language
☆40Updated last year
Related projects ⓘ
Alternatives and complementary repositories for Formality-Core
- An upcoming operating system built on Type-Theory☆43Updated 4 years ago
- Minimal, efficient proof language☆14Updated 5 years ago
- Agda libraries relevant to Moonad☆14Updated 5 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- ☆36Updated 3 years ago
- A Haskell implementation of the Formality language☆18Updated 4 years ago
- ☆36Updated 6 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- A nano "theorem prover".☆61Updated 5 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆26Updated 5 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Fωμ type checker and compiler☆51Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- Absal ex☆55Updated last year
- A simple implementation of linear type theory☆38Updated 7 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 6 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last year
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- Standard library for the Formality language☆18Updated 4 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆67Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A next-gen, massively parallel, beta-optimal functional runtime.☆10Updated 2 years ago
- An implementation of the Formality language in C☆13Updated 5 years ago