Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > sci.logic > #348319

The Sandcastle of Paul Taraus Interactors (Was: A Case for Impurity: The Applied Pi Calculus)

Cross-posted to 3 groups.

Show all headers | View raw

Hi,

While Paul Taraus Interactors were somewhere
between stackfull and stackless coroutines,
they were still a castle built on sand.

What was the comms? An interactor was a child
of a parent, and had only two comms, input "next"
and output "the". And there was not much

asynchronizity. But look at the new
library(misc/intercom) that provides ADA
Rendez Vous in Dogelog Player for Java:

:- ensure_loaded(library(misc/intercom)).

producer(C) :-
    between(1,10,X),
    Y is X*X,
    send(C,[Y]),
    fail.
producer(_).

consumer(C) :-
    between(1,10,_),
    recv(C,[Y]),
    write(Y), nl,
    fail.
consumer(_).

As the show case shows, it even works with
cooperating coroutines. I have looked at it
for 5 hours straight, its beautiful:

?- cpu_chan_new(C), create_task(producer(C)),
    create_task(consumer(C)), sleep(1000).
1
4
9
16
25
36
49
64
81
100
C = 0rReference.

Bye

Mild Shock schrieb:
> Hi,
> 
> How it started:
> 
> The Applied Pi Calculus: Mobile Values,
> New Names, and Secure Communication
> Martín Abadi et al. - Google Brain
> https://arxiv.org/abs/1609.03003
> 
> How its going:
> 
> Dynamic Control Flow in
> Large-Scale Machine Learning
> Martín Abadi et al. - Google Brain
> https://research.google/pubs/dynamic-control-flow-in-large-scale-machine-learning/ 
> 
> 
> Have Fun!
> 
> Bye
> 
> Mild Shock schrieb:
>> Hi,
>>
>> You might also try this here:
>>
>> McCulloch, Warren S.; Pitts, Walter (1943-12-01).
>> "A logical calculus of the ideas immanent in
>> nervous activity". The Bulletin of Mathematical
>> Biophysics. 5 (4): 115–133.
>> https://www.cs.cmu.edu/~epxing/Class/10715/reading/McCulloch.and.Pitts.pdf 
>>
>>
>> It has a simple neuron model, and shows
>> for example in Figure 1. How it can act
>> in a Boolean algebra way.
>>
>> If you have Booean algebra, you can also
>> build finite state machine. You can encode
>> state as bit vectors.
>>
>> Bye

Back to sci.logic | Previous | Next — Previous in thread | Find similar | Unroll thread

Thread

A Case for Impurity: The Applied Pi Calculus (Was: A logical calculus in nervous activity [McCulloch & Pitts 1943]) Mild Shock <janburse@fastmail.fm> - 2026-08-04 14:42 +0200
  The Sandcastle of Paul Taraus Interactors (Was: A Case for Impurity: The Applied Pi Calculus) Mild Shock <janburse@fastmail.fm> - 2026-08-04 15:06 +0200

csiph-web