We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
from the old todo file:
reflection: generate mapreduces, so that makes tcomplete and ecomplete effectively just
(mapreduce τ̇) (\ <||> = ⊥ | _ = ⊤) (_×_) (mapreduce ė) (\ <||> = ⊥ | <| _ |> = ⊥ | _ = ⊤) tcomplete (_×_)
generate e^ and t^ from e and t, both erasure erasure functions, matched for both. what else? probably the movement rules.
need newer version of agda to do reflection, which will probably break other proofs we've done so far because of backwards compatiblity issues.
The text was updated successfully, but these errors were encountered:
migrating this to the issue tracker repo.
Sorry, something went wrong.
ivoysey
No branches or pull requests
from the old todo file:
reflection: generate mapreduces, so that makes tcomplete and ecomplete
effectively just
generate e^ and t^ from e and t, both erasure erasure functions, matched
for both. what else? probably the movement rules.
need newer version of agda to do reflection, which will probably break
other proofs we've done so far because of backwards compatiblity issues.
The text was updated successfully, but these errors were encountered: