Soonad / Formality-Core
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
- An upcoming operating system built on Type-Theory☆43Updated 4 years ago
- Agda libraries relevant to Moonad☆14Updated 5 years ago
- ☆35Updated 6 years ago
- Minimal, efficient proof language☆14Updated 5 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 5 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆26Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- A Haskell implementation of the Formality language☆18Updated 4 years ago
- Absal ex☆57Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 10 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Specification of the Cedille Core language☆29Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- ☆36Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- An implementation of the Formality language in JavaScript☆71Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- Fωμ type checker and compiler☆52Updated 2 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago