Jan Willem Klop

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

Jan Willem Klop: Term Rewriting and Lambda Calculus. LICS 2012: 12

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

Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss: Automatic Sequences and Zip-Specifications. CoRR abs/1201.3251 (2012)

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky: Discriminating Lambda-Terms Using Clocked Boehm Trees. CoRR abs/1212.0401 (2012)

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

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

Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop: Productivity of stream definitions. Theor. Comput. Sci. 411(4-5): 765-782 (2010)

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

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

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop: Modular Construction of Fixed Point Combinators and Clocked Boehm Trees. CoRR abs/1002.2578 (2010)

Henk Barendregt, Jan Willem Klop: Applications of infinitary lambda calculus. Inf. Comput. 207(5): 559-582 (2009)

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop: Let's Make a Difference! CoRR abs/0911.1004 (2009)

Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop: Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting. CoRR abs/0911.1009 (2009)

Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer: Lambda calculus with patterns. Theor. Comput. Sci. 398(1-3): 16-31 (2008)

Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel C. de Vrijer: Proving Infinitary Normalization. TYPES 2008: 64-82

Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk: Reduction Strategies and Acyclicity. Rewriting, Computation and Proof 2007: 89-112

Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop: Productivity of Stream Definitions. FCT 2007: 274-287

Clemens Grabmayer, Jan Willem Klop, Bas Luttik: Reflections on a Geometry of Processes. Electr. Notes Theor. Comput. Sci. 162: 183-190 (2006)

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

Clemens Grabmayer, Jan Willem Klop, Bas Luttik: Some Remarks on Definability of Process Graphs. CONCUR 2006: 16-36

Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom: Vicious Circles in Orthogonal Term Rewriting Systems. Electr. Notes Theor. Comput. Sci. 124(2): 65-77 (2005)

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

Zena M. Ariola, Jan Willem Klop, Detlef Plump: Bisimilarity in Term Graph Rewriting. Inf. Comput. 156(1-2): 2-24 (2000)

Inge Bethke, Jan Willem Klop, Roel C. de Vrijer: Descendants and Origins in Term Rewriting. Inf. Comput. 159(1-2): 59-124 (2000)

Fairouz Kamareddine, Jan Willem Klop: Editorial. J. Log. Comput. 10(3): 321-322 (2000)

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

Inge Bethke, Jan Willem Klop, Roel C. de Vrijer: Extending partial combinatory algebras. Mathematical Structures in Computer Science 9(4): 483-505 (1999)

Marc Bezem, Jan Willem Klop, Vincent van Oostrom: Diagram Techniques for Confluence. Inf. Comput. 141(2): 172-204 (1998)

Jan Willem Klop: Origin Tracking in Term Rewriting (Abstract). RTA 1998: 1

Zena M. Ariola, Jan Willem Klop, Detlef Plump: Confluent rewriting of bisimilar term graphs. Electr. Notes Theor. Comput. Sci. 7: 19 (1997)

Zena M. Ariola, Jan Willem Klop: Lambda Calculus with Explicit Recursion. Inf. Comput. 139(2): 154-233 (1997)

Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries: Infinitary Lambda Calculus. Theor. Comput. Sci. 175(1): 93-125 (1997)

Zena M. Ariola, Jan Willem Klop: Equational Term Graph Rewriting. Fundam. Inform. 26(3/4): 207-240 (1996)

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

Inge Bethke, Jan Willem Klop, Roel C. de Vrijer: Completing Partial Combinatory Algebras With Unique Head-Normal Forms. LICS 1996: 448-454

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

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

Jan Willem Klop: Term Graph Rewriting. HOA 1995: 1-16

Inge Bethke, Jan Willem Klop: Collapsing Partial Combinatory Algebras. HOA 1995: 57-73

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

Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop: Problems in Rewriting III. RTA 1995: 457-471

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

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

Zena M. Ariola, Jan Willem Klop: Cyclic Lambda Graph Rewriting. LICS 1994: 416-425

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

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

Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk: Combinatory Reduction Systems: Introduction and Survey. Theor. Comput. Sci. 121(1&2): 279-308 (1993)

Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop: More Problems in Rewriting. RTA 1993: 468-487

Frank S. de Boer, Jan Willem Klop, Catuscia Palamidessi: Asynchronous Communication in Process Algebra. LICS 1992: 137-147

Jan Willem Klop, Aart Middeldorp: Sequentiality in Orthogonal Term Rewriting Systems. J. Symb. Comput. 12(2): 161-196 (1991)

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

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

Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop: Open Problems in Rewriting. RTA 1991: 445-456

Jan Willem Klop, Roel C. de Vrijer: Extended Term Rewriting Systems. CTRS 1990: 26-50

Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop: On the Power of Subsumption and Context Checks. DISCO 1990: 131-140

Jan Willem Klop: Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond. ICALP 1990: 350-369

Jos C. M. Baeten, Jan Willem Klop (Eds.): CONCUR '90, Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, August 27-30, 1990, Proceedings. Lecture Notes in Computer Science 458, Springer 1990, isbn 3-540-53048-7

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

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland: Term-Rewriting Systems with Rule Priorities. Theor. Comput. Sci. 67(2&3): 283-301 (1989)

Krzysztof R. Apt, Roland N. Bol, Jan Willem Klop: On the Safe Termination of PROLOG Programs. ICLP 1989: 353-368

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

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

Jan A. Bergstra, Jan Willem Klop: Process theory based on bisimulation semantics. REX Workshop 1988: 50-122

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

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

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

Jan A. Bergstra, Jan Willem Klop: ACT_tau: A Universal Axiom System for Process Specification. Algebraic Methods 1987: 447-463

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop: Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. PARLE (2) 1987: 94-111

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop: Term Rewriting Systems with Priorities. RTA 1987: 83-94

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

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

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

Jan A. Bergstra, Jan Willem Klop: Process Algebra for Synchronous Communication. Information and Control 60(1-3): 109-137 (1984)

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

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

Jan A. Bergstra, Jan Willem Klop, J. V. Tucker: Process Algebra with Asynchronous Communication Mechanisms. Seminar on Concurrency 1984: 76-95

Jan A. Bergstra, Jan Willem Klop: The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. ICALP 1984: 82-94

Jan A. Bergstra, Jan Willem Klop: Initial Algebra Specifications for Parametrized Data Types. Elektronische Informationsverarbeitung und Kybernetik 19(1/2): 17-31 (1983)

J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer: Linear Time and Branching Time Semantics for Recursion with Merge. ICALP 1983: 39-51

Jan A. Bergstra, Jan Willem Klop, J. V. Tucker: Algebraic Tools for System Construction. Logic of Programs 1983: 34-44

Jan A. Bergstra, Jan Willem Klop: Strong Normalization and Perpetual Reductions in the Lambda Calculus. Elektronische Informationsverarbeitung und Kybernetik 18(7/8): 403-417 (1982)

Jan A. Bergstra, Jan Willem Klop: Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. ICALP 1982: 23-34

Jan A. Bergstra, Jan Willem Klop: A formalized proof system for total correctness of while programs. Symposium on Programming 1982: 26-36

J. W. de Bakker, Jan Willem Klop, John-Jules Ch. Meyer: Correctness of Programs with Function Procedures. Logic of Programs 1981: 94-112

Jan Willem Klop: Combinatory reduction systems. Univ. Utrecht 1980, pp. I-XIII, 1-323

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

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

Henk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken: Degrees of Sensible Lambda Theories. J. Symb. Log. 43(1): 45-55 (1978)

Jan Willem Klop: On solvability by lambda I - terms. Lambda-Calculus and Computer Science Theory 1975: 342-345