### "Not X. Not Y. Just Z."
Enter lambda terms, click subterms to reduce them, and explore different reduction paths through a branching derivation tree.。业内人士推荐新收录的资料作为进阶阅读
。业内人士推荐新收录的资料作为进阶阅读
Eventually, we’ll have a tree with mixed dirty and clean nodes, where only the dirty nodes need updating. Importantly, unlike the original push-based reactivity, the order that we visit the nodes isn’t important5. This means we don’t need to figure out the optimal path through the entire tree, and can use a simpler recursive algorithm, as long as we make sure to skip any nodes that were already marked as dirty.
Share on Tumblr (Opens in new window)。关于这个话题，新收录的资料提供了深入分析