Replies: 1 comment
-
Was actually just asked this on the I'm not super familiar with Koka.. it has functional semantics though, so it is likely a much simpler algorithm (looking at the Perceus paper they mostly appear to focus on matching incs with decs for elimination). |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Is the Perceus approach similar to Lobster ? https://www.microsoft.com/en-us/research/uploads/prod/2020/11/perceus-tr-v1.pdf
maybe it provides some of the formalism behind the compile-time rules to suppress unnecessary reference increment/decrement ?
It's part of the interesting Koka language: https://koka-lang.github.io/koka/doc/index.html
Beta Was this translation helpful? Give feedback.
All reactions