[TYPES] FInCo 2005: FOUNDATIONS OF INTERACTIVE COMPUTATION -- CFP

[Martin Berger]

> However, a satisfactory foundation of interactive 
> computation, analogously to the one that Turing Machines 
> and lambda-calculus provide for algorithms, is still lacking.

i take issue with that statement. in fact i think it's wrong.

in what sense are various process calculi worse foundations
for interactive computation than Turing Machines and lambda
calculus provide for algorithms (whatever you may mean by
algorithms)? of course many of the existing approaches
towards modeling concurrency have their problems, but that
is also true of these sequential models.

martin