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

Adding a directly typing parser #6

Merged
merged 1 commit into from
Sep 29, 2024

Conversation

maxkurze1
Copy link

Directly typed parser

I am proposing a parser which directly builds a typed syntax tree.

This parser uses the same syntax as the default one to serve as a drop-in replacement.
Its only difference is that it is using <{ ... }> to declare a Koika action.

Typechecking

For some reason, that is still to be investigated, the normal coq type checker fails to check some actions which are declared with this typed syntax. In these cases, users are advised to use #[program] Definition instead of normal Definitions.

I've already tried different alternatives, but none seemed to work so far. I've testing using Equations instead of Definition which did not result in any difference. Additionally, I investigated unicoq, which introduced more typechecking problems than it solved.

Syntax sugar

This typed parser includes the syntax additions proposed in #3.

@sertel
Copy link
Collaborator

sertel commented Sep 29, 2024

Very cool stuff!
Great work!

@sertel sertel merged commit 1b9942d into Barkhausen-Institut:master Sep 29, 2024
1 check passed
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