Modeling side effects using threads

Question

I watched this Channel 9 talk and a very interesting expression was made in about 60 minutes.

He said that even with completely pure functions, after introducing the flows, you can imitate the side effects.

The way he outlined this uses the C-omega notation, which I am not familiar with, and it already has the appropriate language support for this.

The problem I am facing is how do you implement get and set handlers without assignments? Of course, handlers would have to change the value so that the inner loop of the thread could write a new value?

What am I missing? How could I implement this in LISP, for example, which has no special constructs?

Answer 1

The problem I am facing is how do you implement get and set handlers without assignments? Of course, handlers would have to change the value so that the inner loop of the thread could write a new value?

Yes you are right. Eric believes that each thread has its own message queue. Sending a message using Value(n)explicitly changes the state of the message queue. He makes him more mysterious than he: he simply trades tasks for another form of volatile state. It takes advantage of the prerequisite for the language to make it syntactically clean.

, IO ( IO), . , Value(n) n , Value(T t) , t ( ). Voilà, ( IO !).