On solvability by lambda I - terms. - Jan Willem Klop (Lambda-Calculus and Computer Science Theory, 1975)

Degrees of Sensible Lambda Theories. - Henk Barendregt; Jan A. Bergstra; Jan Willem Klop; Henri Volken (J. Symb. Log., 1978)

Church-Rosser Strategies in the Lambda Calculus. - Jan A. Bergstra; Jan Willem Klop (Theor. Comput. Sci., 1979)

Combinatory reduction systems. - Jan Willem Klop (1980)

Invertible Terms in the Lambda Calculus. - Jan A. Bergstra; Jan Willem Klop (Theor. Comput. Sci., 1980)

Correctness of Programs with Function Procedures. - J. W. de Bakker; Jan Willem Klop; John-Jules Ch. Meyer (Logic of Programs, 1981)

Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. - Jan A. Bergstra; Jan Willem Klop (ICALP, 1982)

Formal Proof Systems for Program Equivalence. - Jan A. Bergstra; Jan Willem Klop (Formal Description of Programming Concepts, 1982)

A formalized proof system for total correctness of while programs. - Jan A. Bergstra; Jan Willem Klop (Symposium on Programming, 1982)

Strong Normalization and Perpetual Reductions in the Lambda Calculus. - Jan A. Bergstra; Jan Willem Klop (J. Inf. Process. Cybern., 1982)

Algebraic Tools for System Construction. - Jan A. Bergstra; Jan Willem Klop; John V. Tucker (Logic of Programs, 1983)

Initial Algebra Specifications for Parametrized Data Types. - Jan A. Bergstra; Jan Willem Klop (J. Inf. Process. Cybern., 1983)

A proof rule for restoring logic circuits. - Jan A. Bergstra; Jan Willem Klop (Integr., 1983)

Process Algebra with Asynchronous Communication Mechanisms. - Jan A. Bergstra; Jan Willem Klop; John V. Tucker (Seminar on Concurrency, 1984)

The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. - Jan A. Bergstra; Jan Willem Klop (ICALP, 1984)

Process Algebra for Synchronous Communication - Jan A. Bergstra; Jan Willem Klop (Inf. Control., 1984)

Linear Time and Branching Time Semantics for Recursion with Merge. - J. W. de Bakker; Jan A. Bergstra; Jan Willem Klop; John-Jules Ch. Meyer (Theor. Comput. Sci., 1984)

Proving Program Inclusion Using Hoare's Logic. - Jan A. Bergstra; Jan Willem Klop (Theor. Comput. Sci., 1984)

Verification of an alternating bit protocol by means of process algebra. - Jan A. Bergstra; Jan Willem Klop (Mathematical Methods of Specification and Synthesis of Software Systems, 1985)

Algebra of Communicating Processes with Abstraction. - Jan A. Bergstra; Jan Willem Klop (Theor. Comput. Sci., 1985)

Conditional Rewrite Rules: Confluence and Termination. - Jan A. Bergstra; Jan Willem Klop (J. Comput. Syst. Sci., 1986)

ACTtau: A Universal Axiom System for Process Specification. - Jan A. Bergstra; Jan Willem Klop (Algebraic Methods, 1987)

Conditional axioms and α/β-calculus in process algebra. - Jos C. M. Baeten; Jan A. Bergstra; Jan Willem Klop (Formal Description of Programming Concepts, 1987)

Failures without chaos: a new process semantics for fair abstraction. - Jan A. Bergstra; Jan Willem Klop; Ernst-Rüdiger Olderog (Formal Description of Programming Concepts, 1987)

Term Rewriting Systems with Priorities. - Jos C. M. Baeten; Jan A. Bergstra; Jan Willem Klop (RTA, 1987)

Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator. - Jos C. M. Baeten; Jan A. Bergstra; Jan Willem Klop (Comput. J., 1987)

On the Consistency of Koomen's Fair Abstraction Rule. - Jos C. M. Baeten; Jan A. Bergstra; Jan Willem Klop (Theor. Comput. Sci., 1987)

Needed Reduction and Spine Strategies for the Lambda Calculus - Hendrik Pieter Barendregt; Richard Kennaway; Jan Willem Klop; M. Ronan Sleep (Inf. Comput., 1987)

Process theory based on bisimulation semantics. - Jan A. Bergstra; Jan Willem Klop (REX Workshop, 1988)

Readies and Failures in the Algebra of Communicating Processes. - Jan A. Bergstra; Jan Willem Klop; Ernst-Rüdiger Olderog (SIAM J. Comput., 1988)

On the Safe Termination of PROLOG Programs. - Krzysztof R. Apt; Roland N. Bol; Jan Willem Klop (ICLP, 1989)

Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-. - Yoshihito Toyama; Jan Willem Klop; Hendrik Pieter Barendregt (RTA, 1989)

Term-Rewriting Systems with Rule Priorities. - Jos C. M. Baeten; Jan A. Bergstra; Jan Willem Klop; W. P. Weijland (Theor. Comput. Sci., 1989)

Unique Normal Forms for Lambda Calculus with Surjective Pairing - Jan Willem Klop; Roel C. de Vrijer (Inf. Comput., 1989)

Extended Term Rewriting Systems. - Jan Willem Klop; Roel C. de Vrijer (CTRS, 1990)

On the Power of Subsumption and Context Checks. - Roland N. Bol; Krzysztof R. Apt; Jan Willem Klop (DISCO, 1990)

Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond. - Jan Willem Klop (ICALP, 1990)

Open Problems in Rewriting. - Nachum Dershowitz; Jean-Pierre Jouannaud; Jan Willem Klop (RTA, 1991)

Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract). - Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (RTA, 1991)

Sequentiality in Orthogonal Term Rewriting Systems. - Jan Willem Klop; Aart Middeldorp (J. Symb. Comput., 1991)

An Analysis of Loop Checking Mechanisms for Logic Programs. - Roland N. Bol; Krzysztof R. Apt; Jan Willem Klop (Theor. Comput. Sci., 1991)

Asynchronous Communication in Process Algebra - Frank S. de Boer; Jan Willem Klop; Catuscia Palamidessi (LICS, 1992)

More Problems in Rewriting. - Nachum Dershowitz; Jean-Pierre Jouannaud; Jan Willem Klop (RTA, 1993)

Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. - Jos C. M. Baeten; Jan A. Bergstra; Jan Willem Klop (J. ACM, 1993)

Combinatory Reduction Systems: Introduction and Survey. - Jan Willem Klop; Vincent van Oostrom; Femke van Raamsdonk (Theor. Comput. Sci., 1993)

Cyclic Lambda Graph Rewriting - Zena M. Ariola; Jan Willem Klop (LICS, 1994)

Syntactic Definitions of Undefined: On Defining the Undefined. - Zena M. Ariola; Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (TACS, 1994)

Modularity of Confluence: A Simplified Proof. - Jan Willem Klop; Aart Middeldorp; Yoshihito Toyama; Roel C. de Vrijer (Inf. Process. Lett., 1994)

On the Adequacy of Graph Rewriting for Simulating Term Rewriting. - Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (ACM Trans. Program. Lang. Syst., 1994)

Collapsing Partial Combinatory Algebras. - Inge Bethke; Jan Willem Klop (HOA, 1995)

Term Graph Rewriting. - Jan Willem Klop (HOA, 1995)

Problems in Rewriting III. - Nachum Dershowitz; Jean-Pierre Jouannaud; Jan Willem Klop (RTA, 1995)

Infinitary Lambda Calculi and Böhm Models. - Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (RTA, 1995)

Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems. - Yoshihito Toyama; Jan Willem Klop; Hendrik Pieter Barendregt (J. ACM, 1995)

Transfinite Reductions in Orthogonal Term Rewriting Systems - Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (Inf. Comput., 1995)

Completing Partial Combinatory Algebras With Unique Head-Normal Forms. - Inge Bethke; Jan Willem Klop; Roel C. de Vrijer (LICS, 1996)

Equational Term Graph Rewriting. - Zena M. Ariola; Jan Willem Klop (Fundam. Informaticae, 1996)

Comparing Curried and Uncurried Rewriting. - Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (J. Symb. Comput., 1996)

Confluent rewriting of bisimilar term graphs. - Zena M. Ariola; Jan Willem Klop; Detlef Plump (EXPRESS, 1997)

Lambda Calculus with Explicit Recursion. - Zena M. Ariola; Jan Willem Klop (Inf. Comput., 1997)

Infinitary Lambda Calculus. - Richard Kennaway; Jan Willem Klop; M. Ronan Sleep; Fer-Jan de Vries (Theor. Comput. Sci., 1997)

Origin Tracking in Term Rewriting (Abstract). - Jan Willem Klop (RTA, 1998)

Diagram Techniques for Confluence. - Marc Bezem; Jan Willem Klop; Vincent van Oostrom (Inf. Comput., 1998)

Extending partial combinatory algebras. - Inge Bethke; Jan Willem Klop; Roel C. de Vrijer (Math. Struct. Comput. Sci., 1999)

Bisimilarity in Term Graph Rewriting. - Zena M. Ariola; Jan Willem Klop; Detlef Plump (Inf. Comput., 2000)

Descendants and Origins in Term Rewriting. - Inge Bethke; Jan Willem Klop; Roel C. de Vrijer (Inf. Comput., 2000)

Editorial. - Fairouz Kamareddine; Jan Willem Klop (J. Log. Comput., 2000)

A geometric proof of confluence by decreasing diagrams. - Jan Willem Klop; Vincent van Oostrom; Roel C. de Vrijer (J. Log. Comput., 2000)

Vicious Circles in Orthogonal Term Rewriting Systems. - Jeroen Ketema; Jan Willem Klop; Vincent van Oostrom (WRS, 2004)

Infinitary Normalization. - Jan Willem Klop; Roel C. de Vrijer (We Will Show Them! (2), 2005)

Reflections on a Geometry of Processes. - Clemens Grabmayer; Jan Willem Klop; Bas Luttik (APC 25, 2005)

Iterative Lexicographic Path Orders. - Jan Willem Klop; Vincent van Oostrom; Roel C. de Vrijer (Essays Dedicated to Joseph A. Goguen, 2006)

Some Remarks on Definability of Process Graphs. - Clemens Grabmayer; Jan Willem Klop; Bas Luttik (CONCUR, 2006)

Reduction Strategies and Acyclicity. - Jan Willem Klop; Vincent van Oostrom; Femke van Raamsdonk (Rewriting, Computation and Proof, 2007)

Proving Infinitary Normalization. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop; Roel C. de Vrijer (TYPES, 2008)

Lambda calculus with patterns. - Jan Willem Klop; Vincent van Oostrom; Roel C. de Vrijer (Theor. Comput. Sci., 2008)

Let's Make a Difference! - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop (CoRR, 2009)

Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop (CoRR, 2009)

Applications of infinitary lambda calculus. - Henk Barendregt; Jan Willem Klop (Inf. Comput., 2009)

Modular Construction of Fixed Point Combinators and Clocked Bohm Trees. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop (LICS, 2010)

Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop; Vincent van Oostrom (RTA, 2010)

Modular Construction of Fixed Point Combinators and Clocked Boehm Trees - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop (CoRR, 2010)

Productivity of stream definitions. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Ariya Isihara; Jan Willem Klop (Theor. Comput. Sci., 2010)

Degrees of Streams. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop (Integers, 2011)

On equal μ-terms. - Jörg Endrullis; Clemens Grabmayer; Jan Willem Klop; Vincent van Oostrom (Theor. Comput. Sci., 2011)

The free process algebra generated by δ, ϵ and τ. - Piet Rodenburg; Jan Willem Klop; Karst Koymans; Jos L. M. Vrancken (Theor. Comput. Sci., 2011)

Automatic Sequences and Zip-Specifications. - Clemens Grabmayer; Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Lawrence S. Moss (LICS, 2012)

Term Rewriting and Lambda Calculus. - Jan Willem Klop (LICS, 2012)

Arithmetic Self-Similarity of Infinite Sequences. - Dimitri Hendriks; Frits Dannenberg; Jörg Endrullis; Mark Dow; Jan Willem Klop (CoRR, 2012)

Highlights in infinitary rewriting and lambda calculus. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop (Theor. Comput. Sci., 2012)

Clocks for Functional Programs. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Andrew Polonsky (The Beauty of Functional Code, 2013)

Obituary for Jaco de Bakker, 1939-2012. - Jan A. Bergstra; Jan Willem Klop; Jan Rutten (Bull. EATCS, 2013)

Streams are Forever. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop (Bull. EATCS, 2013)

Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop; Vincent van Oostrom (Log. Methods Comput. Sci., 2014)

An Introduction to the Clocked Lambda Calculus. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Andrew Polonsky (CoRR, 2014)

Discriminating Lambda-Terms Using Clocked Boehm Trees - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Andrew Polonsky (Log. Methods Comput. Sci., 2014)

Degrees of Transducibility. - Jörg Endrullis; Jan Willem Klop; Aleksi Saarela; Markus A. Whiteland (WORDS, 2015)

Clocked lambda calculus. - Jörg Endrullis; Dimitri Hendriks; Jan Willem Klop; Andrew Polonsky (Math. Struct. Comput. Sci., 2017)

Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems. - Jörg Endrullis; Jan Willem Klop; Roy Overbeek (FSCD, 2018)

Degrees of Infinite Words, Polynomials, and Atoms (Extended Version). - Jörg Endrullis; Juhani Karhumäki; Jan Willem Klop; Aleksi Saarela (CoRR, 2018)

Degrees of Infinite Words, Polynomials and Atoms. - Jörg Endrullis; Juhani Karhumäki; Jan Willem Klop; Aleksi Saarela (Int. J. Found. Comput. Sci., 2018)

Confluence of the Chinese Monoid. - Jörg Endrullis; Jan Willem Klop (The Art of Modelling Computational Systems, 2019)

Braids via term rewriting. - Jörg Endrullis; Jan Willem Klop (Theor. Comput. Sci., 2019)

Transducer degrees: atoms, infima and suprema. - Jörg Endrullis; Jan Willem Klop; Rena Bakhshi (Acta Informatica, 2020)

Decreasing Diagrams for Confluence and Commutation. - Jörg Endrullis; Jan Willem Klop; Roy Overbeek (Log. Methods Comput. Sci., 2020)

Star Games and Hydras. - Jörg Endrullis; Jan Willem Klop; Roy Overbeek (Log. Methods Comput. Sci., 2021)