Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Allow higher-ranked types #3

Merged
merged 3 commits into from
Jan 30, 2023

Conversation

alexfmpe
Copy link
Contributor

@alexfmpe alexfmpe commented Jan 7, 2023

The readme and cabal description both claim support for higher-rank functions, but it didn't seem to be actually be exposed since the module only exports parse.

Note I've only tested this on top of #2.

Had to "fix" two incomplete pattern matches. I don't really know if RelConsFunVar should do something different than RelVar here though.

"Free Theorems for Sublanguages of Haskell" barely mentions higher-rank functions besides claiming they're supported so I wasn't too sure what to expect but results seem to be consistent with first-rank equivalents, at least as far as the relations go. Doesn't look like it goes all the way to actual equations, but that's also happening with type constructor variables (e.g. (a -> b) -> f a -> f b vs (a -> b) -> [a] -> [b]) so it might be a separate issue. EDIT: #5.

higher-rank-id
higher-rank-const
higher-rank-map

@ichistmeinname ichistmeinname merged commit 9a84f28 into ichistmeinname:master Jan 30, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants