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.

Sign up for GitHub

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

Jump to bottom

Proper solution to the patience game #43

Open

JoshOrndorff opened this issue Jan 4, 2019 · 0 comments

Owner

JoshOrndorff commented Jan 4, 2019

dckc showed how to encode select. This will solve the patience game that I couldn't figure out when writing the tutorial.

new once in {
  once!(Nil) |
  for(pat1 <- n1; _ <- once) { p1 } |
  for(pat2 <- n2; _ <- once) { p2 }
}

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment