Soonad / Formality-HaskellLinks
A Haskell implementation of the Formality language
☆18Updated 5 years ago
Alternatives and similar repositories for Formality-Haskell
Users that are interested in Formality-Haskell are comparing it to the libraries listed below
Sorting:
- ICFP tutorial☆39Updated 3 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- OCaml backend for Idris2☆19Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- GRIN backend for Idris2☆33Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- An efficient packed, immutable UTF8-backed Unicode text type for Haskell☆33Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- ☆35Updated 6 years ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆68Updated 3 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆48Updated 7 months ago