Term rewriting systems JW Klop, JW Klop Centrum voor Wiskunde en Informatica, 1990 | 1651* | 1990 |

Process algebra for synchronous communication JA Bergstra, JW Klop Information and control 60 (1-3), 109-137, 1984 | 1364 | 1984 |

Algebra of communicating processes with abstraction JA Bergstra, JW Klop Theoretical computer science 37, 77-121, 1985 | 991 | 1985 |

Combinatory reduction systems JW Klop | 827 | 1980 |

Combinatory reduction systems: introduction and survey JW Klop, V Van Oostrom, F Van Raamsdonk Theoretical computer science 121 (1-2), 279-308, 1993 | 370 | 1993 |

Conditional rewrite rules: Confluence and termination JA Bergstra, JW Klop Journal of Computer and System Sciences 32 (3), 323-362, 1986 | 316 | 1986 |

Syntax and defining equations for an interrupt mechanism in process algebra JA Bergstra, JCM Baeten, JW Klop Fundamenta informaticae: quarterly 9, 127-167, 1986 | 245 | 1986 |

The algebra of recursively defined processes and the algebra of regular processes JA Bergstra, JW Klop Algebra of Communicating Processes, 1-25, 1995 | 221 | 1995 |

Confluence for abstract and higher-order rewriting V van Oostrom Ph. D. Thesis, Vrije Universiteit, 1984 | 209 | 1984 |

On the consistency of Koomen's fair abstraction rule JCM Baeten, JA Bergstra, JW Klop Theoretical Computer Science 51 (1-2), 129-176, 1987 | 203 | 1987 |

Transfinite reductions in orthogonal term rewriting systems R Kennaway, JW Klop, R Sleep, FJ Devries Information and computation 119 (1), 18-38, 1995 | 194 | 1995 |

Infinitary lambda calculus JR Kennaway, JW Klop, MR Sleep, FJ de Vries Theoretical Computer Science 175 (1), 93-125, 1997 | 190 | 1997 |

Algebra of communicating processes JA Bergstra, JW Klop CWI Monograph series 3, 89-138, 1986 | 185 | 1986 |

Equational term graph rewriting ZM Ariola, JW Klop Fundamenta Informaticae 26 (3, 4), 207-240, 1996 | 172 | 1996 |

Decidability of bisimulation equivalence for process generating context-free languages JCM Baeten, JA Bergstra, JW Klop Journal of the ACM (JACM) 40 (3), 653-682, 1993 | 168 | 1993 |

Decidability of bisimulation equivalence for processes generating context-free languages JCM Baeten, JA Bergstra, JW Klop International Conference on Parallel Architectures and Languages Europe, 94-111, 1987 | 157 | 1987 |

Term rewriting systems: a tutorial JW Klop bulletin No. 32, 1987 | 153 | 1987 |

Fixed point semantics in process algebras JA Bergstra, JW Klop | 149 | 1982 |

Verification of an alternating bit protocol by means of process algebra protocol JA Bergstra, JW Klop Int. Spring School on Mathematical Methods of Specification and Synthesis of …, 1985 | 132 | 1985 |

Process theory based on bisimulation semantics JA Bergstra, JW Klop Workshop/School/Symposium of the REX Project (Research and Education in …, 1988 | 129 | 1988 |