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

Changed definition of runTacTm to have simpler patterns. #3250

Merged
merged 2 commits into from
Jul 3, 2016
Merged

Changed definition of runTacTm to have simpler patterns. #3250

merged 2 commits into from
Jul 3, 2016

Conversation

ahmadsalim
Copy link

This is to avoid exhaustion of the pattern matching coverage checker in GHC 8 as stated in #3226 .

@david-christiansen
Copy link
Contributor

What's the reason for the irrefutable patterns here? It would be good to have a comment explaining the reasoning.

@ahmadsalim
Copy link
Author

@david-christiansen It should be dependent vectors, so I give a size argument. It will fail otherwise, I can add a comment.

…ed against values returned by `tacTmArgs`.
@david-christiansen
Copy link
Contributor

I understand why they can be irrefutable, but what do we gain by that?

@ahmadsalim
Copy link
Author

@david-christiansen It shows that they should always match and use fail from the monad.

@ahmadsalim ahmadsalim merged commit e84774a into idris-lang:master Jul 3, 2016
@ahmadsalim ahmadsalim deleted the fix/simplify-runtactm branch July 3, 2016 21:04
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