Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming

[1]  Samson Abramsky,et al.  On Semantic Foundations for Applicative Multiprogramming , 1983, ICALP.

[2]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[3]  Matthew Hennessy,et al.  Powerdomains and nondeterministic recursive definitions , 1982, Symposium on Programming.

[4]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[5]  Gilles Kahn,et al.  The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[6]  Robin Milner,et al.  Processes: A Mathematical Model of Computing Agents , 1975 .

[7]  Irène Guessarian,et al.  Algebraic semantics , 1981, Lecture Notes in Computer Science.

[8]  Gordon D. Plotkin,et al.  A Powerdomain Construction , 1976, SIAM J. Comput..

[9]  Manfred Broy,et al.  Fixed PointTheory for Communication and Concurrency , 1982, Formal Description of Programming Concepts.

[10]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[11]  Gordon Plotkin,et al.  An Operational Semantics for CSP. , 1982 .

[12]  C. A. R. Hoare,et al.  A Theory of Nondeterminism , 1980, ICALP.

[13]  Rocco De Nicola,et al.  Testing Equivalence for Processes , 1983, ICALP.