Soonad / Formality-CoreLinks
Specification of the Formality proof and programming language
☆41Updated 2 years ago
Alternatives and similar repositories for Formality-Core
Users that are interested in Formality-Core are comparing it to the libraries listed below
Sorting:
- An upcoming operating system built on Type-Theory☆43Updated 4 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆26Updated 6 years ago
- Minimal, efficient proof language☆14Updated 6 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- Agda libraries relevant to Moonad☆14Updated 6 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- ☆35Updated 6 years ago
- An implementation of the Formality language in JavaScript☆71Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- Absal ex☆57Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- Package manager for Idris☆35Updated 2 years ago
- ☆36Updated 3 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆72Updated 8 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Thoughts and stuff☆69Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago