This repository was archived by the owner on Apr 11, 2021. It is now read-only.
Implemented kind-checker #1
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This pull requests checks for the well-formedness of types, and allows to infer the kind of any algebraic data type. Additional support for GADTs should be possible from what's already implemented. I also prepared the possibility for the user to define type aliases (for now there is just an
undefinedfor them, since there is no parser for type aliases this should not be a problem). Types can be used in a function type signature before they are defined, since the type declarations are analyzed beforehand. However, mutually recursive type declarations are yet to be handled. The REPL now features a GHCi-inspired:kindcommand to see the inferred kind of any type.