Soonad / Formality-CoreLinks
Specification of the Formality proof and programming language
☆41Updated 3 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 5 years ago
- ☆35Updated 7 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆17Updated 6 years ago
- Specification of the Cedilleum language, a dependently typed language with pattern matching that compiles to Cedille Core☆28Updated 6 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- ☆36Updated 4 years ago
- Specification of the Cedille Core language☆35Updated 5 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Absal ex☆58Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆64Updated last year
- LL(1) parser generator verified in Coq☆48Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Multiplication on optimal λ-calculus reducers☆22Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Minimal, efficient proof language☆14Updated 6 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆84Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 11 months ago
- theseus, functional programming language with fully reversible computation☆126Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- Thoughts and stuff☆70Updated 5 years ago
- Fωμ type checker and compiler☆56Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago