evertedsphere / sound-and-completeLinks
An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
☆84Updated 8 years ago
Alternatives and similar repositories for sound-and-complete
Users that are interested in sound-and-complete are comparing it to the libraries listed below
Sorting:
- ☆41Updated 8 years ago
- Map lazy functional language constructs to LLVM IR☆52Updated 6 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 5 years ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- ICFP tutorial☆39Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- An efficient packed, immutable UTF8-backed Unicode text type for Haskell☆33Updated 7 years ago
- Recursion schemes for Idris☆64Updated 7 years ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆69Updated 4 months ago
- JHC Haskell compiler split into reusable components☆57Updated 7 years ago
- Simplified Observational Type Theory☆87Updated 2 years ago
- Drafts, notes and resources for adding linear typing to GHC.☆79Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- Type provider library for Idris☆95Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A monad for interfacing with external SAT solvers☆65Updated 7 months ago
- Measure time complexity empirically.☆48Updated 10 years ago
- A fast open-union type, suitable for 100+ contained alternatives.☆100Updated last year
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Haskell library for simple, concise and fast generic operations.☆82Updated 2 years ago
- Efficient implementation of the implicit treap data structure☆63Updated 4 years ago
- Template for Hindley-Milner based languages☆39Updated 4 years ago
- A prototype programming language for programming with runners☆92Updated 4 years ago
- A two-dimensional parser combinator library.☆41Updated 8 years ago