LightAndLight / sized-hkts
Higher kinded polymorphism in a language with unboxed, statically sized datatypes.
☆50Updated 3 months ago
Alternatives and similar repositories for sized-hkts:
Users that are interested in sized-hkts are comparing it to the libraries listed below
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Example row-polymorphism implementations☆61Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years 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
- ICFP tutorial☆39Updated 3 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 5 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Automatic piecewise-mutable references for your types☆42Updated 4 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- A simple set of io-uring bindings in Haskell☆28Updated 4 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 9 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Inigo: A Package Manager for Idris2☆61Updated 2 years ago
- type safe, concurrent, pauseless, copying, generational GC. Implementation https://github.com/Avi-D-coder/sundial-gc☆30Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- Efficient implementation of the implicit treap data structure☆63Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- The Alms Programming Language☆44Updated 6 years ago
- Low-overhead effect management for concrete monads☆37Updated 3 years ago
- ☆35Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 2 months ago