[My first post on the FONC mailing list had a wrong layout. Therefore I retry]
This discussion mentions concurrency, the Meta II parser-compiler, Planner,
and LINDA, which apply such concepts as non-determinism, parallelism and
communication. These concepts are well described by the Algebra of
This discussion mentions concurrency, the Meta II parser-compiler, Planner, and
LINDA, which apply such concepts as non-determinism, parallelism and
communication. These concepts are well described by the Algebra of
Communicating Processes (ACP, also known as Process Algebra). This theory was
i
___
> From: Carl Hewitt
>To: Alan Kay
>Cc: Programming Language Design ; Dale Schumacher
>; The Friday Morning Applied Complexity Coffee
>Group ; "computational-actors-gu...@googlegroups.com"
>; Fundamentals of New Computing
>
>Sent: Satu
>To: Dale Schumacher
>Cc: Programming Language Design ; The Friday Morning
>Applied Complexity Coffee Group ;
>"computational-actors-gu...@googlegroups.com"
>; Alan Kay ;
>Fundamentals of New Computing
>Sent: Friday, November 25, 2011 12:11 PM
>Subject: RE: [CA
Dale Schumacher
>> To: Fundamentals of New Computing ; CAG
>> ; Programming Language Design
>> ; The Friday Morning Applied Complexity Coffee Group
>>
>> Sent: Friday, November 25, 2011 10:05 AM
>> Subject: [fonc] Fexpr the Ultimate Lambda
>>
>> Fexpr t
