LightAndLight / sized-hkts
Higher kinded polymorphism in a language with unboxed, statically sized datatypes.
☆50Updated 2 months ago
Alternatives and similar repositories for sized-hkts:
Users that are interested in sized-hkts are comparing it to the libraries listed below
- Map lazy functional language constructs to LLVM IR☆50Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- ICFP tutorial☆39Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- freshly-fermented, dependently-typed mustard, with a substructural aftertaste☆31Updated 4 years ago
- Example row-polymorphism implementations☆61Updated last year
- ☆39Updated 7 months ago
- Toy version of Git/Mercurial built using recursion schemes. Implements lazy diffing and merging of merkle dir trees. Solves toy versions …☆3Updated 3 years ago
- Book: Introduction to Dependent Types with Idris☆77Updated 2 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 2 years ago
- A simple set of io-uring bindings in Haskell☆28Updated 4 years ago
- Inigo: A Package Manager for Idris2☆61Updated 2 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 10 months ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- Efficient parser combinators for Haskell☆39Updated 11 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- A Haskell monad transformer library for data validation☆36Updated last year
- Low-overhead effect management for concrete monads☆37Updated 2 years ago
- Efficient implementation of the implicit treap data structure☆63Updated 3 years ago