From 7623787b1cbb16e73ba5caf326bbe40ac50855a7 Mon Sep 17 00:00:00 2001 From: Danila Fedorin Date: Thu, 30 Jul 2020 02:05:43 -0700 Subject: [PATCH] Mention Kai's help in time traveling article. --- content/blog/haskell_lazy_evaluation/index.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/content/blog/haskell_lazy_evaluation/index.md b/content/blog/haskell_lazy_evaluation/index.md index b9db216..5e2ba6f 100644 --- a/content/blog/haskell_lazy_evaluation/index.md +++ b/content/blog/haskell_lazy_evaluation/index.md @@ -386,7 +386,8 @@ later read from, and future state, from which you can read values before your write them. Check out [his complete example](https://kcsongor.github.io/time-travel-in-haskell-for-dummies/#a-single-pass-assembler-an-example) here. -Alternatively, here's an example from my research. I'll be fairly +Alternatively, here's an example from my research, which my +coworker and coauthor Kai helped me formulate. I'll be fairly vague, since all of this is still in progress. The gist is that we have some kind of data structure (say, a list or a tree), and we want to associate with each element in this data