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

A few questions about supercompilation #13

Open
Hirrolot opened this issue Dec 26, 2023 · 0 comments
Open

A few questions about supercompilation #13

Hirrolot opened this issue Dec 26, 2023 · 0 comments

Comments

@Hirrolot
Copy link

Thank you for your work on this project. It was really helpful for me to study the code after reading papers on supercompilation.

I have a few questions on the subject matter (I hope this is an adequate place to ask questions):

  1. Suppose we have a higher-order language. We can write a supercompiler for it directly (as in the project HOSC), or we can perform closure conversion and launch supercompilation on a closure-converted language term. The advantage is that writing a supercompiler for a first-order language is much simpler. Do you see any obstacles of doing so? Have people already experimented with this approach?
  2. Have you seen a project/paper where supercompilation is used for deciding equivalence of terms during dependent type checking?
  3. Where can I find samples of SLL code for stress-testing a supercompiler? In the future, I want to do some profiling of supercompilation and, possibly, find ways to optimize it.

Thanks again and enjoy the New Year!

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

1 participant