Soonad / Formality-Haskell
A Haskell implementation of the Formality language
☆18Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for Formality-Haskell
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- A usable type system for call by push-value☆28Updated 4 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 3 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 6 years ago
- Category theory formalized in cubical agda☆20Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Session Types with Priority in Linear Haskell☆25Updated 5 months ago
- OCaml backend for Idris2☆19Updated 4 years ago
- Automatic piecewise-mutable references for your types☆43Updated 4 years ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆13Updated 4 years ago
- Existential type.☆36Updated 6 months ago
- A nano "theorem prover".☆61Updated 5 years ago
- Haskell implementation of interaction net-based lambda evaluation☆16Updated 8 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 weeks ago
- Austin's supercompiler work☆21Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- Minimal, efficient proof language☆14Updated 5 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Efficient parser combinators for Haskell☆39Updated 7 months ago
- Linear map categories in Agda