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:
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- ICFP tutorial☆39Updated 4 years ago
- Absal ex☆58Updated 2 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated last week
- Tiny type-checker with dependent types☆78Updated 11 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Minimal, efficient proof language☆14Updated 6 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Build tool for ATS.☆42Updated 3 years ago
- Automatic piecewise-mutable references for your types☆42Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 4 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago