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

No-score type inference #55

Open
GeorgeR227 opened this issue Jun 25, 2024 · 0 comments
Open

No-score type inference #55

GeorgeR227 opened this issue Jun 25, 2024 · 0 comments

Comments

@GeorgeR227
Copy link
Contributor

When we type infer, we check to see that there are enough known types around to choose a rule. However, with user help we can implement a no-score type inference, allowing for even stronger inference.

Essentially, even if the user gives us that an operation is, for example d_0, we can only infer types if one is already known. But we know that this operator can only have a very specific src/tgt, so even if they were both :infer, we could guess that these types must be Form0 and Form1 respectively.

Implementing this may require two sets of rules for each op set that may then be combined together. One will have untyped generic names, like d, that require scoring and one will have typed names, like d_0, that can use the aggressive inference above.

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

No branches or pull requests

1 participant