Jan Willem Klop

Publication Activity (10 Years)

Years Active: 1975-2021
Publications (10 Years): 12

Top Venues

CoRR

Log. Methods Comput. Sci.

Theor. Comput. Sci.

LICS

Univ. Utrecht (PHD)

Education History

Univ. Utrecht

PHD

Publications

Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Star Games and Hydras. Log. Methods Comput. Sci. 17 (2) (2021)
Jörg Endrullis, Jan Willem Klop, Rena Bakhshi
Transducer degrees: atoms, infima and suprema. Acta Informatica 57 (3-5) (2020)
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Decreasing Diagrams for Confluence and Commutation. Log. Methods Comput. Sci. 16 (1) (2020)
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Star Games and Hydras. CoRR (2020)
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Decreasing Diagrams for Confluence and Commutation. CoRR (2019)
Jörg Endrullis, Jan Willem Klop
Braids via term rewriting. Theor. Comput. Sci. 777 (2019)
Jörg Endrullis, Jan Willem Klop
Confluence of the Chinese Monoid. The Art of Modelling Computational Systems (2019)
Jörg Endrullis, Jan Willem Klop, Roy Overbeek
Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems. FSCD (2018)
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
Degrees of Infinite Words, Polynomials and Atoms. Int. J. Found. Comput. Sci. 29 (5) (2018)
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
Degrees of Infinite Words, Polynomials, and Atoms (Extended Version). CoRR (2018)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky
Clocked lambda calculus. Math. Struct. Comput. Sci. 27 (5) (2017)
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
Degrees of Infinite Words, Polynomials and Atoms. DLT (2016)
Jörg Endrullis, Jan Willem Klop, Aleksi Saarela, Markus A. Whiteland
Degrees of Transducibility. WORDS (2015)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky
An Introduction to the Clocked Lambda Calculus. CoRR (2014)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky
Discriminating Lambda-Terms Using Clocked Boehm Trees Log. Methods Comput. Sci. 10 (2) (2014)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom
Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples. Log. Methods Comput. Sci. 10 (2) (2014)
Jan A. Bergstra, Jan Willem Klop, Jan Rutten
Obituary for Jaco de Bakker, 1939-2012. Bull. EATCS 109 (2013)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
Streams are Forever. Bull. EATCS 109 (2013)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky
Clocks for Functional Programs. The Beauty of Functional Code (2013)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
Highlights in infinitary rewriting and lambda calculus. Theor. Comput. Sci. 464 (2012)
Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss
Automatic Sequences and Zip-Specifications CoRR (2012)
Dimitri Hendriks, Frits Dannenberg, Jörg Endrullis, Mark Dow, Jan Willem Klop
Arithmetic Self-Similarity of Infinite Sequences. CoRR (2012)
Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss
Automatic Sequences and Zip-Specifications. LICS (2012)
Jan Willem Klop
Term Rewriting and Lambda Calculus. LICS (2012)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
Degrees of Streams. Integers (2011)
Piet Rodenburg, Jan Willem Klop, Karst Koymans, Jos L. M. Vrancken
The free process algebra generated by δ, ϵ and τ. Theor. Comput. Sci. 412 (28) (2011)
Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, Vincent van Oostrom
On equal μ-terms. Theor. Comput. Sci. 412 (28) (2011)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
Modular Construction of Fixed Point Combinators and Clocked Bohm Trees. LICS (2010)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom
Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. RTA (2010)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop
Productivity of stream definitions. Theor. Comput. Sci. 411 (4-5) (2010)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
Modular Construction of Fixed Point Combinators and Clocked Boehm Trees CoRR (2010)
Henk Barendregt, Jan Willem Klop
Applications of infinitary lambda calculus. Inf. Comput. 207 (5) (2009)
Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
Let's Make a Difference! CoRR (2009)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting CoRR (2009)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel C. de Vrijer
Proving Infinitary Normalization. TYPES (2008)
Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
Lambda calculus with patterns. Theor. Comput. Sci. 398 (1-3) (2008)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop
Productivity of Stream Definitions. FCT (2007)
Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk
Reduction Strategies and Acyclicity. Rewriting, Computation and Proof (2007)
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
Some Remarks on Definability of Process Graphs. CONCUR (2006)
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
Reflections on a Geometry of Processes. Electron. Notes Theor. Comput. Sci. 162 (2006)
Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
Iterative Lexicographic Path Orders. Essays Dedicated to Joseph A. Goguen (2006)
Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom
Vicious Circles in Orthogonal Term Rewriting Systems. Electron. Notes Theor. Comput. Sci. 124 (2) (2005)
Jan Willem Klop, Roel C. de Vrijer
Infinitary Normalization. We Will Show Them! (2) (2005)
Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
Descendants and Origins in Term Rewriting. Inf. Comput. 159 (1-2) (2000)
Fairouz Kamareddine, Jan Willem Klop
Editorial. J. Log. Comput. 10 (3) (2000)
Zena M. Ariola, Jan Willem Klop, Detlef Plump
Bisimilarity in Term Graph Rewriting. Inf. Comput. 156 (1-2) (2000)
Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
A geometric proof of confluence by decreasing diagrams. J. Log. Comput. 10 (3) (2000)
Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
Extending partial combinatory algebras. Math. Struct. Comput. Sci. 9 (4) (1999)
Jan Willem Klop
Origin Tracking in Term Rewriting (Abstract). RTA (1998)
Marc Bezem, Jan Willem Klop, Vincent van Oostrom
Diagram Techniques for Confluence. Inf. Comput. 141 (2) (1998)
Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
Infinitary Lambda Calculus. Theor. Comput. Sci. 175 (1) (1997)
Zena M. Ariola, Jan Willem Klop
Lambda Calculus with Explicit Recursion. Inf. Comput. 139 (2) (1997)
Zena M. Ariola, Jan Willem Klop, Detlef Plump
Confluent rewriting of bisimilar term graphs. EXPRESS (1997)
Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
Completing Partial Combinatory Algebras With Unique Head-Normal Forms. LICS (1996)
Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
Comparing Curried and Uncurried Rewriting. J. Symb. Comput. 21 (1) (1996)
Zena M. Ariola, Jan Willem Klop
Equational Term Graph Rewriting. Fundam. Informaticae 26 (3/4) (1996)
Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt
Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems. J. ACM 42 (6) (1995)
Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
Infinitary Lambda Calculi and Böhm Models. RTA (1995)
Jan Willem Klop
Term Graph Rewriting. HOA (1995)
Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
Problems in Rewriting III. RTA (1995)
Inge Bethke, Jan Willem Klop
Collapsing Partial Combinatory Algebras. HOA (1995)
Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
Transfinite Reductions in Orthogonal Term Rewriting Systems Inf. Comput. 119 (1) (1995)
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)
Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel C. de Vrijer
Modularity of Confluence: A Simplified Proof. Inf. Process. Lett. 49 (2) (1994)
Zena M. Ariola, Jan Willem Klop
Cyclic Lambda Graph Rewriting LICS (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) (1994)
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. J. ACM 40 (3) (1993)
Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
More Problems in Rewriting. RTA (1993)
Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk
Combinatory Reduction Systems: Introduction and Survey. Theor. Comput. Sci. 121 (1&2) (1993)
Frank S. de Boer, Jan Willem Klop, Catuscia Palamidessi
Asynchronous Communication in Process Algebra LICS (1992)
Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
Open Problems in Rewriting. RTA (1991)
Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop
An Analysis of Loop Checking Mechanisms for Logic Programs. Theor. Comput. Sci. 86 (1) (1991)
Jan Willem Klop, Aart Middeldorp
Sequentiality in Orthogonal Term Rewriting Systems. J. Symb. Comput. 12 (2) (1991)
Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract). RTA (1991)
Jan Willem Klop, Roel C. de Vrijer
Extended Term Rewriting Systems. CTRS (1990)
Jan Willem Klop
Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond. ICALP (1990)
Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop
On the Power of Subsumption and Context Checks. DISCO (1990)
Jan Willem Klop, Roel C. de Vrijer
Unique Normal Forms for Lambda Calculus with Surjective Pairing Inf. Comput. 80 (2) (1989)
Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt
Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-. RTA (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) (1989)
Krzysztof R. Apt, Roland N. Bol, Jan Willem Klop
On the Safe Termination of PROLOG Programs. ICLP (1989)
Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog
Readies and Failures in the Algebra of Communicating Processes. SIAM J. Comput. 17 (6) (1988)
Jan A. Bergstra, Jan Willem Klop
Process theory based on bisimulation semantics. REX Workshop (1988)
Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog
Failures without chaos: a new process semantics for fair abstraction. Formal Description of Programming Concepts (1987)
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
On the Consistency of Koomen's Fair Abstraction Rule. Theor. Comput. Sci. 51 (1987)
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) (1987)
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. PARLE (2) (1987)
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
Conditional axioms and α/β-calculus in process algebra. Formal Description of Programming Concepts (1987)
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
Term Rewriting Systems with Priorities. RTA (1987)
Jan A. Bergstra, Jan Willem Klop
: A Universal Axiom System for Process Specification. Algebraic Methods (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) (1987)
Jan A. Bergstra, Jan Willem Klop
Conditional Rewrite Rules: Confluence and Termination. J. Comput. Syst. Sci. 32 (3) (1986)
Jan A. Bergstra, Jan Willem Klop
Algebra of Communicating Processes with Abstraction. Theor. Comput. Sci. 37 (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)
Jan A. Bergstra, Jan Willem Klop
Proving Program Inclusion Using Hoare's Logic. Theor. Comput. Sci. 30 (1984)
Jan A. Bergstra, Jan Willem Klop
Process Algebra for Synchronous Communication Inf. Control. 60 (1-3) (1984)
Jan A. Bergstra, Jan Willem Klop
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. ICALP (1984)
Jan A. Bergstra, Jan Willem Klop, John V. Tucker
Process Algebra with Asynchronous Communication Mechanisms. Seminar on Concurrency (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 (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. ICALP (1983)

Jan Willem Klop.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jan Willem Klop