Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
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 normalDefinition
s.I've already tried different alternatives, but none seemed to work so far. I've testing using
Equations
instead ofDefinition
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.