LightAndLight / sized-hkts
Higher kinded polymorphism in a language with unboxed, statically sized datatypes.
☆50Updated last month
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
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ICFP tutorial☆39Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- A simple set of io-uring bindings in Haskell☆28Updated 4 years ago
- Example row-polymorphism implementations☆61Updated last year
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Book: Introduction to Dependent Types with Idris☆77Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 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
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- Automatic piecewise-mutable references for your types☆42Updated 4 years ago
- Efficient parser combinators for Haskell☆39Updated 10 months ago
- being an experiment with potato power☆23Updated 5 years ago
- Invertible parsing for S-expressions☆34Updated 6 months ago
- Inigo: A Package Manager for Idris2☆61Updated 2 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- a functional programming language with algebraic effects and handlers☆81Updated 3 weeks ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Low-overhead effect management for concrete monads☆37Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 3 months ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 2 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- ☆39Updated 7 months ago
- A nano "theorem prover".☆62Updated 6 years ago