Edward Kmett - Propagators - Boston Haskell

แชร์
ฝัง
  • เผยแพร่เมื่อ 26 ก.ย. 2024
  • Recorded on Nov 18, 2015
    www.meetup.com/...

ความคิดเห็น • 4

  • @ekmett
    @ekmett 8 ปีที่แล้ว +6

    At around 43:00, I mention the graph having forks and joins, but it only has forks in Lindsey's model. If I add the machinery I have stolen from [Concurrent Revisions](research.microsoft.com/en-us/projects/revisions/) to the Par monad _then_ I get joins.

  • @ekmett
    @ekmett 8 ปีที่แล้ว +1

    At 16:23 I mention you need the ability to compare for equality. You only need that power when the cell participates in a cycle. Effectively every edge into a node that can't be compared for equality is a stratifying edge.