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

Can I find the talk somewhere? #1

Open
ajrouvoet opened this issue Jul 19, 2017 · 2 comments
Open

Can I find the talk somewhere? #1

ajrouvoet opened this issue Jul 19, 2017 · 2 comments

Comments

@ajrouvoet
Copy link

Looking at the code in this repository I'd love to hear your talk.
Do you know if it has been recorded at the meeting? Or, if that's not the case, do you maybe have some additional notes that could help understand the ideas, implementation and the limitations of what's in this repository?

Thank you in advance.

@UlfNorell
Copy link
Owner

No recordings and the notes are all in my head. I'd be happy to answer questions though.

Some limitations:

  • Only Int64 -> Int64 -> Int64 functions.
  • Very limited instruction set
  • No nested loops (but I think that would be straightforward to add)
  • No heap

The aim I had when starting this was to have all proof obligations discharged automatically (the only thing you have to fill in manually is loop invariants). Thus the representation of the machine state is very symbolic, allowing the Agda type checker do a lot of computation over it.

@ajrouvoet
Copy link
Author

Thank you for the response. I don't have any concrete questions at the moment.

It's a shame that the AIM talks aren't recorded. Not sure if this the right place, but maybe this can be considered for it's next iteration?

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

2 participants