On Reduction-Based Process Semantics

A formulation of semantic theories for processes which is based on reduction relation and equational reasoning is studied. The new construction can induce meaningful theories for processes, both in strong and weak settings. The resulting theories in many cases coincide with, and sometimes generalise, observation-based formulation of behavioural equivalence. The basic construction of reduction-based theories is studied, taking a simple name passing calculus called v-calculus as an example. Results on other calculi are also briefly discussed.

[1]  Bent Thomsen,et al.  A calculus of higher order communicating systems , 1989, POPL '89.

[2]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[3]  C.-H. Luke Ong.  The Lazy Lambda Calculus : an investigation into the foundations of functional programming , 1988 .

[4]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[5]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[6]  Kohei Honda,et al.  An Interaction-based Language and its Typing System , 1994, PARLE.

[7]  S. Abramsky.  The lazy lambda calculus , 1990 .

[8]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[9]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[10]  J. Roger Hindley,et al.  To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism , 1980 .

[11]  Cliff B. Jones.  A pi-Calculus Semantics for an Object-Based Design Notation , 1993, CONCUR.

[12]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[13]  David Turner,et al.  Research topics in functional programming , 1990 .

[14]  Giuseppe Longo,et al.  Set-theoretical models of λ-calculus: theories, expansions, isomorphisms , 1983, Ann. Pure Appl. Log..

[15]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[16]  D. Walker,et al.  A Calculus of Mobile Processes, Part Ii , 1989 .

[17]  Robin Milner,et al.  Functions as processes , 1990, Mathematical Structures in Computer Science.

[18]  Nobuko Yoshida,et al.  Combinatory representation of mobile processes , 1994, POPL '94.

[19]  Gérard Boudol,et al.  Asynchrony and the Pi-calculus , 1992 .

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

[21]  Nobuko Yoshida,et al.  Replication in Concurrent Combinators , 1994, TACS.

[22]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[23]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[24]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..