challenge

Type inference system

An implementation of a strongly-typed System F in Haskell

Strongly-typed System F in Haskell

GitHub

117 stars
12 watching
9 forks
Language: Haskell
last commit: almost 4 years ago

Related projects:

RepositoryDescriptionStars
sweirich/graded-haskellMechanizations for two dependently-typed languages with graded types24
sweirich/dthExploring and showcasing examples of dependently-typed programs in Haskell303
mrkkrp/factsA Haskell library for working with refined types to represent and manipulate data structures57
wilbowma/curAn experimental language with static and dynamic types, theorem proving, and meta-programming capabilities.222
migamake/json-autotypeGenerates Haskell type declarations from JSON input to improve developer productivity when working with big JSON APIs.148
effectfully-ou/haskell-challengesA collection of Haskell-specific coding challenges with test suites and expected solutions.90
marcoheisig/typoAn inference library for Common Lisp's type system39
i-am-tom/learn-me-a-haskellLearning Haskell with focus on dependent types and type-level programming using the OneOf data structure70
hspec/hspecA testing framework for Haskell programming language755
johnsundell/codextendedA suite of extensions that augment the Codable API in Swift with type inference-powered capabilities and conveniences.1,502
tfausak/rampartA Haskell library for analyzing interval relationships and dependencies.77
superstar64/aithA 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
lexi-lambda/higher-rankA Haskell implementation of type checking and evaluation for higher-rank polymorphism101
sdiehl/zurihac-cryptoSmall minimal examples of modern cryptographic techniques in Haskell79
ekmett/haskCategory theory for Haskell with a strong lens-like flavor.163