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

Kind systems #24

Open
favonia opened this issue May 28, 2018 · 5 comments
Open

Kind systems #24

favonia opened this issue May 28, 2018 · 5 comments

Comments

@favonia
Copy link
Contributor

favonia commented May 28, 2018

Do we have a good proof theory for them? @cangiuli @mortberg

@cangiuli
Copy link

Do you mean, types satisfying regularity? I thought we didn't think this was a useful kind.

@favonia
Copy link
Contributor Author

favonia commented May 28, 2018

We thought they were useless in the presence of discrete types, but now without equality types (in this proof theory) discrete types seem useless. So, maybe there is room for us to reconsider regular types.

@cangiuli
Copy link

Ah, I see. I have never thought seriously about their proof theory, and I don't think @mortberg has either?

@mortberg
Copy link

I have not, it would be interesting to have this though. I think some examples can be done in the regular fragment which should be more efficient.

@favonia favonia transferred this issue from RedPRL/redtt Nov 27, 2022
@favonia
Copy link
Contributor Author

favonia commented Nov 27, 2022

It is unclear whether we want regular types, but we need to have a kind system first.

@favonia favonia changed the title Typechecking for regular types Kind systems Nov 27, 2022
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

3 participants