Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday

The Spectra of Words.- On the Undecidability of Coherent Logic.- Lob's Logic Meets the ?-Calculus.- A Characterisation of Weak Bisimulation Congruence.- Bohm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms.- Explaining Constraint Programming.- Sharing in the Weak Lambda-Calculus.- Term Rewriting Meets Aspect-Oriented Programming.- Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes.- Primitive Rewriting.- Infinitary Rewriting: From Syntax to Semantics.- Reducing Right-Hand Sides for Termination.- Reduction Strategies for Left-Linear Term Rewriting Systems.- Higher-Order Rewriting: Framework, Confluence and Termination.- Timing the Untimed: Terminating Successfully While Being Conservative.- Confluence of Graph Transformation Revisited.- Compositional Reasoning for Probabilistic Finite-State Behaviors.- Finite Equational Bases in Process Algebra: Results and Open Questions.- Skew and ?-Skew Confluence and Abstract Bohm Semantics.- A Mobility Calculus with Local and Dependent Types.- Model Theory for Process Algebra.- Expression Reduction Systems and Extensions: An Overview.- Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem.

[1]  Jan A. Bergstra,et al.  Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.

[2]  Jan Willem Klop,et al.  Transfinite Reductions in Orthogonal Term Rewriting Systems , 1995, Inf. Comput..

[3]  Jean-Pierre Jouannaud,et al.  Open Problems in Rewriting , 1991, RTA.

[4]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[5]  Jan Willem Klop,et al.  Term Graph Rewriting , 1995, HOA.

[6]  Jan A. Bergstra,et al.  Readies and Failures in the Algebra of Communicating Processes , 1988, SIAM J. Comput..

[7]  Jan A. Bergstra,et al.  Failures without chaos: a new process semantics for fair abstraction , 1987, Formal Description of Programming Concepts.

[8]  Jan A. Bergstra,et al.  Representability in lambda algebras , 1976 .

[9]  Jan Willem Klop,et al.  ACP - a universal axiom system for process specification , 1987 .

[10]  Jan A. Bergstra,et al.  Term-Rewriting Systems with Rule Priorities , 1989, Theor. Comput. Sci..

[11]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[12]  Jan A. Bergstra,et al.  Church-Rosser Strategies in the Lambda Calculus , 1979, Theor. Comput. Sci..

[13]  Krzysztof R. Apt,et al.  An Analysis of Loop Checking Mechanisms for Logic Programs , 1991, Theor. Comput. Sci..

[14]  Jan Willem Klop,et al.  Comparing Curried and Uncurried Rewriting , 1993, J. Symb. Comput..

[15]  Jean-Pierre Jouannaud,et al.  Problems in Rewriting III , 1995, RTA.

[16]  J. R. Kennaway,et al.  The adequacy of term graph rewriting for simulating term rewriting , 1993 .

[17]  W. Fokkink,et al.  Finite equational bases in process algebra: results and open questions , 2005 .

[18]  Jan A. Bergstra,et al.  Degrees of sensible lambda theories , 1978, Journal of Symbolic Logic.

[19]  Hendrik Pieter Barendregt,et al.  Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft- , 1989, RTA.

[20]  Jan A. Bergstra,et al.  Algebraic Tools for System Construction , 1983, Logic of Programs.

[21]  Jan A. Bergstra,et al.  Term Rewriting Systems with Priorities , 1987, RTA.

[22]  Jan A. Bergstra,et al.  Invertible Terms in the Lambda Calculus , 1980, Theor. Comput. Sci..

[23]  Jan A. Bergstra,et al.  Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator , 1987, Comput. J..

[24]  Zena M. Ariola,et al.  Lambda Calculus with Explicit Recursion , 1997, Inf. Comput..

[25]  Jan A. Bergstra,et al.  Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras , 1982, ICALP.

[26]  Jan A. Bergstra,et al.  A convergence theorem in process algebra , 1982 .

[27]  Jan A. Bergstra,et al.  A proof rule for restoring logic circuits , 1983, Integr..

[28]  Jan A. Bergstra,et al.  Process theory based on bisimulation semantics , 1988, REX Workshop.

[29]  J. R. Kennaway,et al.  An introduction to term graph rewriting , 1993 .

[30]  Aart Middeldorp,et al.  Sequentiality in Orthogonal Term Rewriting Systems , 1991, J. Symb. Comput..

[31]  Zena M. Ariola,et al.  Cyclic lambda graph rewriting , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[32]  Wan Fokkink,et al.  Introduction to Process Algebra , 1999, Texts in Theoretical Computer Science. An EATCS Series.

[33]  Jan A. Bergstra,et al.  Syntax and defining equations for an interrupt mechanism in process algebra , 1985 .

[34]  Paul-André Melliès,et al.  Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem , 2005, Processes, Terms and Cycles.

[35]  Jan Willem Klop,et al.  Infinitary Lambda Calculus , 1997, Theoretical Computer Science.

[36]  Jan Willem Klop,et al.  Extended Term Rewriting Systems , 1990, CTRS.

[37]  Vincent van Oostrom,et al.  Vicious Circles in Orthogonal Term Rewriting Systems , 2005, Electron. Notes Theor. Comput. Sci..

[38]  J. R. Kennaway,et al.  An infinitary Church-Rosser property for non-collapsing orthogonal term rewriting systems , 1993 .

[39]  Jan A. Bergstra,et al.  Proving Program Inclusion Using Hoare's Logic , 1984, Theor. Comput. Sci..

[40]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[41]  Jan A. Bergstra,et al.  Conditional Rewrite Rules: Confluence and Termination , 1986, J. Comput. Syst. Sci..

[42]  Jan Willem Klop,et al.  Descendants and Origins in Term Rewriting , 2000, Inf. Comput..

[43]  Jan Willem Klop,et al.  Unique Normal Forms for Lambda Calculus with Surjective Pairing , 1989, Inf. Comput..

[44]  Jan A. Bergstra,et al.  Process algebra: specification and verification in bisimulation semantics , 1986 .

[45]  John-Jules Ch. Meyer,et al.  Correctness of Programs with Function Procedures , 1981, Logic of Programs.

[46]  Zena M. Ariola,et al.  Equational Term Graph Rewriting , 1996, Fundam. Informaticae.

[47]  Jan Willem Klop,et al.  Completing partial combinatory algebras with unique head-normal forms , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[48]  Vincent van Oostrom,et al.  Diagram Techniques for Confluence , 1998, Inf. Comput..

[49]  Susan Robinson.  Dutch , 2007, Cheers!.

[50]  Yoshihito Toyama,et al.  Modularity of Confluence: A Simplified Proof , 1994, Inf. Process. Lett..

[51]  Jan Willem Klop,et al.  Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract) , 1991, RTA.

[52]  J. R. Kennaway,et al.  Event structures and orthogonal term graph rewriting , 1993 .

[53]  Jan A. Bergstra,et al.  Verification of an alternating bit protocol by means of process algebra , 1985, Mathematical Methods of Specification and Synthesis of Software Systems.

[54]  Jan A. Bergstra,et al.  A formalized proof system for total correctness of while programs , 1982, Symposium on Programming.

[55]  Jan Willem Klop,et al.  Infinitary Lambda Calculi and Böhm Models , 1995, RTA.

[56]  Jan Willem Klop,et al.  On the adequacy of graph rewriting for simulating term rewriting , 1994, TOPL.

[57]  Frank S. de Boer,et al.  Asynchronous communication in process algebra , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[58]  Jan A. Bergstra,et al.  The Algebra of Recursively Defined Processes and the Algebra of Regular Processes , 1984, ICALP.

[59]  Vincent van Oostrom,et al.  A geometric proof of confluence by decreasing diagrams , 2000, J. Log. Comput..

[60]  Jan A. Bergstra,et al.  Formal Proof Systems for Program Equivalence , 1982, Formal Description of Programming Concepts.

[61]  Jan Willem Klop,et al.  Collapsing Partial Combinatory Algebras , 1995, HOA.

[62]  Vincent van Oostrom,et al.  Combinatory Reduction Systems: Introduction and Survey , 1993, Theor. Comput. Sci..

[63]  Jan A. Bergstra,et al.  Linear Time and Branching Time Semantics for Recursion with Merge , 1983, Theor. Comput. Sci..

[64]  Jan Willem Klop,et al.  Extending partial combinatory algebras , 1999, Mathematical Structures in Computer Science.

[65]  Zena M. Ariola,et al.  Syntactic Definitions of Undefined: On Defining the Undefined , 1994, TACS.

[66]  Hendrik Pieter Barendregt,et al.  Termination for direct sums of left-linear complete term rewriting systems , 1995, JACM.

[67]  Jan A. Bergstra,et al.  A complete inference system for rgular processes with silent moves , 1984 .

[68]  Evangelos Kranakis,et al.  Lower bounds for a class of Kostka numbers , 1986 .

[69]  Hendrik Pieter Barendregt,et al.  Needed Reduction and Spine Strategies for the Lambda Calculus , 1987, Inf. Comput..

[70]  Jan A. Bergstra,et al.  Conditional axioms and α/β-calculus in process algebra , 1987, Formal Description of Programming Concepts.

[71]  Krzysztof R. Apt,et al.  On the Safe Termination of PROLOG Programs , 1989, ICLP.

[72]  Zena M. Ariola,et al.  Confluent rewriting of bisimilar term graphs , 1997, EXPRESS.

[73]  Jan A. Bergstra,et al.  Process Algebra with Asynchronous Communication Mechanisms , 1984, Seminar on Concurrency.

[74]  Jan A. Bergstra,et al.  Initial Algebra Specifications for Parametrized Data Types , 1981, J. Inf. Process. Cybern..

[75]  Jan A. Bergstra,et al.  Algebra of Communicating Processes , 1995, Workshops in Computing.

[76]  Krzysztof R. Apt,et al.  On the Power of Subsumption and Context Checks , 1990, DISCO.

[77]  Henwood,et al.  Author index , 1983, Pharmacology Biochemistry and Behavior.

[78]  Zena M. Ariola,et al.  Bisimilarity in Term Graph Rewriting , 2000, Inf. Comput..

[79]  Jan Willem Klop,et al.  TERM REWRITING SYSTEMS FROM , 2005 .

[80]  Jean-Pierre Jouannaud,et al.  More Problems in Rewriting , 1993, RTA.

[81]  Jan A. Bergstra,et al.  Degrees, reductions and representability in the lambda calculus , 1976 .

[82]  Enno Ohlebusch,et al.  Term Rewriting Systems , 2002 .

[83]  Delia Kesner,et al.  Expression Reduction Systems and Extensions: An Overview , 2005, Processes, Terms and Cycles.

[84]  Jan A. Bergstra,et al.  Strong Normalization and Perpetual Reductions in the Lambda Calculus , 1982, J. Inf. Process. Cybern..