- Theoretical Computer Science 11 (1980) 19-37 @ North-Holland Publishing Company
- Term Rewriting Systems J. W. Klop1
- PROCESS THEORY BASED ON BISIMULATION SEMANTICS J.A. Bergstra
- Information and Computation 141, 172 204 (1998) Diagram Techniques for Confluence
- Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
- An Algebraic Approach to Concurrency ACP~: A Universal Axiom System for Process Specification .............. 447
- Some Remarks on Definability of Process Graphs
- ON SOLVABILITY BY AI -TERMS Mathematical Institute, Budapestlaan-Utrecht~Holland.
- CORRECTNESS OF PROGRAMS WITH FUNCTION PROCEDURES
- A proof rule for restoring logic J.A. Bergstra and J.W. Klop
- Theoretical Computer Science34 (1984) 135-I56 North-Holland
- ALGEBRAIC TOOLS FOP. SYSTEM CONSTRUCTION J.A. Bergstra, J.W. Klop
- Theoretical Computer Science 37 (1985) 77-121 North-Holland
- JOURNAL OF COMPUTER AND SYSTEM SCIENCES 32, 323-362(1986) Conditional Rewrite Rules: Confluence and Termination
- DECIDABILITY OF BISIMULATION EQUIVALENCE FOR PROCESSES GENERATING CONTEXT-FREE LANGUAGES
- SIAM J. COMPUT. Vol. 17, No. 6, December 1988
- Theoretical Computer Science 67 (1989) 283-301 North-Holland
- INFORMATION AND COMPUTATION 80, 97-113 (1989) Unique Normal Forms for Lambda Calculus
- Lecture Notes in Computer Science
- On the Powerof Subsumption and ContextChecks
- TERM REWRITING SYSTEMS FROM CHURCH-ROSSER TO KNUTH-BENDIX AND BEYOND
- EXTENDED TERM REWRITING SYSTEMS Jan WillemKlop
- Asynchronous Communication in Process Algebra (Extended Abstract)
- Revised: 93jul22 14:00 On the Adequacy of Graph Rewriting
- Theoretical Computer Science 121 (1993) 279-308 Combinatory reduction
- Syntactic definitions of undefined: on defining the undefined
- the Adequacy of Graph Rewriting Simulating Term Rewriting
- Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems
- Term Graph Rewriting Jan Willem Klop*
- !I II!(II).... ....
- Infinitary Normalization Jan Willem Klop and Roel de Vrijer
- Lambda Calculus with Patterns Jan Willem Klop1,2,3
- Computing with Actions and Communications Wan Fokkink Jan Willem Klop
- TransfiniteReductionsin OrthogonalTermRewritingSystems (Extendedabstract)
- LINEAR TIME AND BRANCHING TIME SEMANTICS FOR REcURsION WITH MERGE
- Infinitary lambda calculi and BShm models Richard Kennaway 1, Jan Willem Klop2, Ronan Sleep1 and Fer-Jan de Vries3 *
- Theoretical Computer Science 30 (1984) 1-48 North-Holland
- Vicious Circles Orthogonal Term Rewriting Systems
- A FORMALIZEDPROOFSYSTEIIFOR TOTAL CORRECTNESSOF I/HILE PROGRAMS J.A. Bergstra
- PROCESS ALGEBRA WITH ASYNCHRONOUS COMMUNICATION MECHANISMS
- ALGEBRAIC SPECIFICATIONSFOR PARAMETRIZEDDATATYPES WITH MINIMAL PARAMETERAND TARGETALGEBRAS
- Theoretical Computer Science 86 (1991) 35-79 An analysis of loop checking
- eoretical Computer Science 51 ( lSr37)129..136 North-Holland
- VERIFICATION OF AN ALTERNATING BIT PROTOC~.BY MEANSOF PROCESSAtGEBRA J,A, BERGSTRA, J,W, KLOP
- Iterative Lexicographic Path Orders Jan Willem Klop1,2,3
- INFORMATION AND CONTROL 60, 109-137 (1984) Process Algebra for Synchronous Communication
- THE ALGEBRA OF RECURSIVELY DEFINED PROCESSES AND THE ALGEBRA OF REGULAR PROCESSES J.A. Bergstra and J.W. Klop
- Completing Partial Combinatory Algebras with Unique Head-Normal Forms Inge Bethke
- J. Symbolic Computation (1996) 21, 1539 Comparing Curried and Uncurried Rewriting
- Math. Struct. in Comp. Science (1999), vol. 9, pp. 483505. Printed in the United Kingdom c 1999 Cambridge University Press
- Open Problems in Rewriting NacMm Dershowitz*
- Problems in Rewriting III* Nachum Dershowitz 1, Jean-Pierre Jouannaud 2, and Jan Willem Klop3
- More Problems in Rewriting* Nachum Dershowitz1, Jean-Pierre Jouannaud 2, and Jan Willem Klop3
- Reflections on a Geometry of Processes Clemens Grabmayera,1 ,2
- Theoretical ComputerScience 9 (1979) 27-38 @ North-Holland Publishing Company
- Information LettersInformation Processing Letters 49 (1994) 101-109
- Termination for the Direct Sum of Left-Linear Term Rewriting Systems
