ksrky / type-inferenceLinks
Type inference algorithms for functional programming languages
☆10Updated last year
Alternatives and similar repositories for type-inference
Users that are interested in type-inference are comparing it to the libraries listed below
Sorting:
- Haskell library for non-deterministic pattern matching☆17Updated 3 years ago
- open union and open product types in Haskell☆32Updated 4 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- First class patterns and pattern matching, using type families☆17Updated 4 years ago
- Haskell98 indexed functors, monads, comonads☆25Updated 3 years ago
- Fast ByteString Builder☆21Updated 4 months ago
- ☆18Updated 4 years ago
- Template Haskell Implementation of Egison Pattern Matching☆32Updated 4 years ago
- Existential type.☆37Updated 6 months ago
- Hash consing for arbitrary Haskell data types☆25Updated 6 months ago
- fleet-footed ByteString builder☆51Updated 10 months ago
- guardian - the border guardian for your Haskell monorepo package dependencies☆39Updated 6 months ago
- semirings and *-semirings of types in base/haskell-platform☆42Updated last year
- Maps using values' monoidal structure during merging☆42Updated 2 months ago
- Deep evaluation of data structures☆41Updated last week
- 🪆 A Staged Type Theory☆35Updated last year
- Deciding Presburger arithmetic in agda☆32Updated 2 years ago
- Clean up the formatting of 'show' output☆21Updated last month
- Extra type-level operations on GHC.TypeLits.Nat and a custom solver☆18Updated 3 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Dependent hash maps☆14Updated 2 months ago
- Quasiquoter for LLVM☆31Updated 7 years ago
- a collection of various algorithms written using recursion schemes☆22Updated 3 years ago
- High-performance JSON parser☆26Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A purely functional programming language based on higher-order polymorphic lambda calculus☆20Updated last year
- Asymptotically optimal Brodal/Okasaki heaps☆31Updated 6 months ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- Funny little Haskell impl☆18Updated 4 years ago