You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The engine was written in javascript a long time ago, when I did not know a lot about static checking!
It will be very convenient to have it in OCaml, compiled to javascript.
In this rewrite, I'd like to change at least one thing: the "step back". Instead of recording the initial step and "go back to the beginning, go forward $n-1$ steps", it would be much better to apply the "reverse effectful" function.
This also raises the question of how much is computed at runtime by the engine and how much is computed at compile-time by the compiler!
The text was updated successfully, but these errors were encountered:
I just tried [1] - very impressive - towards the end, the rendering got a little lost, especially when I used the back-arrow, forward-arrow a number of times etc. Still, a great tool, thanks for making it available. Can't wait for it to be refactored into ocaml!
[1] https://choum.net/panglesd/slides/slides_CTA/cta_anglesdauriac.html
The engine was written in javascript a long time ago, when I did not know a lot about static checking!
It will be very convenient to have it in OCaml, compiled to javascript.
In this rewrite, I'd like to change at least one thing: the "step back". Instead of recording the initial step and "go back to the beginning, go forward$n-1$ steps", it would be much better to apply the "reverse effectful" function.
This also raises the question of how much is computed at runtime by the engine and how much is computed at compile-time by the compiler!
The text was updated successfully, but these errors were encountered: