challenge
Type inference system
An implementation of a strongly-typed System F in Haskell
Strongly-typed System F in Haskell
117 stars
12 watching
9 forks
Language: Haskell
last commit: over 2 years ago Related projects:
Repository | Description | Stars |
---|---|---|
| Mechanizations for two dependently-typed languages with graded types | 24 |
| Exploring and showcasing examples of dependently-typed programs in Haskell | 303 |
| A Haskell library for working with refined types to represent and manipulate data structures | 57 |
| An experimental language with static and dynamic types, theorem proving, and meta-programming capabilities. | 222 |
| Generates Haskell type declarations from JSON input to improve developer productivity when working with big JSON APIs. | 148 |
| A collection of Haskell-specific coding challenges with test suites and expected solutions. | 90 |
| An inference library for Common Lisp's type system | 39 |
| Learning Haskell with focus on dependent types and type-level programming using the OneOf data structure | 70 |
| A testing framework for Haskell programming language | 755 |
| A suite of extensions that augment the Codable API in Swift with type inference-powered capabilities and conveniences. | 1,502 |
| A Haskell library for analyzing interval relationships and dependencies. | 77 |
| A language project that aims to create a systems programming language with a strong emphasis on type systems and advanced features like levity polymorphism, first-class inline functions, linear types, and effectful regions. | 64 |
| A Haskell implementation of type checking and evaluation for higher-rank polymorphism | 101 |
| Small minimal examples of modern cryptographic techniques in Haskell | 79 |
| Category theory for Haskell with a strong lens-like flavor. | 163 |