Jan Willem Klop

According to our database, Jan Willem Klop authored at least 106 papers between 1975 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2021

Star Games and Hydras.

Jörg Endrullis, Jan Willem Klop, Roy Overbeek

Log. Methods Comput. Sci., 2021

2020

Decreasing Diagrams for Confluence and Commutation.

Jörg Endrullis, Jan Willem Klop, Roy Overbeek

Log. Methods Comput. Sci., 2020

Transducer degrees: atoms, infima and suprema.

Jörg Endrullis, Jan Willem Klop, Rena Bakhshi

Acta Informatica, 2020

2019

Braids via term rewriting.

Jörg Endrullis, Jan Willem Klop

Theor. Comput. Sci., 2019

Confluence of the Chinese Monoid.

Jörg Endrullis, Jan Willem Klop

Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

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

Degrees of Infinite Words, Polynomials, and Atoms (Extended Version).

Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela

CoRR, 2018

Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems.

Jörg Endrullis, Jan Willem Klop, Roy Overbeek

Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

2017

Clocked lambda calculus.

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky

Math. Struct. Comput. Sci., 2017

2015

Degrees of Transducibility.

Jörg Endrullis, Jan Willem Klop, Aleksi Saarela, Markus A. Whiteland

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014

Discriminating Lambda-Terms Using Clocked Boehm Trees

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky

Log. Methods Comput. Sci., 2014

An Introduction to the Clocked Lambda Calculus.

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky

CoRR, 2014

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

2013

Streams are Forever.

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop

Bull. EATCS, 2013

Obituary for Jaco de Bakker, 1939-2012.

Jan A. Bergstra, Jan Willem Klop, Jan Rutten

Bull. EATCS, 2013

Clocks for Functional Programs.

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky

Proceedings of the Beauty of Functional Code, 2013

2012

Highlights in infinitary rewriting and lambda calculus.

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop

Theor. Comput. Sci., 2012

Arithmetic Self-Similarity of Infinite Sequences.

Dimitri Hendriks, Frits Dannenberg, Jörg Endrullis, Mark Dow, Jan Willem Klop

CoRR, 2012

Term Rewriting and Lambda Calculus.

Jan Willem Klop

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Automatic Sequences and Zip-Specifications.

Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011

The free process algebra generated by δ, ϵ and τ.

Piet Rodenburg, Jan Willem Klop, Karst Koymans, Jos L. M. Vrancken

Theor. Comput. Sci., 2011

On equal μ-terms.

Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, Vincent van Oostrom

Theor. Comput. Sci., 2011

Degrees of Streams.

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop

Integers, 2011

2010

Productivity of stream definitions.

Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop

Theor. Comput. Sci., 2010

Modular Construction of Fixed Point Combinators and Clocked Boehm Trees

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop

CoRR, 2010

Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting.

Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Modular Construction of Fixed Point Combinators and Clocked Bohm Trees.

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

Applications of infinitary lambda calculus.

Henk Barendregt, Jan Willem Klop

Inf. Comput., 2009

Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting

Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop

CoRR, 2009

Let's Make a Difference!

Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop

CoRR, 2009

2008

Lambda calculus with patterns.

Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer

Theor. Comput. Sci., 2008

Proving Infinitary Normalization.

Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel C. de Vrijer

Proceedings of the Types for Proofs and Programs, International Conference, 2008

2007

Reduction Strategies and Acyclicity.

Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk

Proceedings of the Rewriting, 2007

2006

Some Remarks on Definability of Process Graphs.

Clemens Grabmayer, Jan Willem Klop, Bas Luttik

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Iterative Lexicographic Path Orders.

Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer

Proceedings of the Algebra, Meaning, and Computation, 2006

2005

Reflections on a Geometry of Processes.

Clemens Grabmayer, Jan Willem Klop, Bas Luttik

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Infinitary Normalization.

Jan Willem Klop, Roel C. de Vrijer

Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume Two, 2005

2004

Vicious Circles in Orthogonal Term Rewriting Systems.

Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom

Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming, 2004

2000

A geometric proof of confluence by decreasing diagrams.

Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer

J. Log. Comput., 2000

Editorial.

Fairouz Kamareddine, Jan Willem Klop

J. Log. Comput., 2000

Descendants and Origins in Term Rewriting.

Inge Bethke, Jan Willem Klop, Roel C. de Vrijer

Inf. Comput., 2000

Bisimilarity in Term Graph Rewriting.

Zena M. Ariola, Jan Willem Klop, Detlef Plump

Inf. Comput., 2000

1999

Extending partial combinatory algebras.

Inge Bethke, Jan Willem Klop, Roel C. de Vrijer

Math. Struct. Comput. Sci., 1999

1998

Diagram Techniques for Confluence.

Marc Bezem, Jan Willem Klop, Vincent van Oostrom

Inf. Comput., 1998

Origin Tracking in Term Rewriting (Abstract).

Jan Willem Klop

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

1997

Infinitary Lambda Calculus.

Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries

Theor. Comput. Sci., 1997

Lambda Calculus with Explicit Recursion.

Zena M. Ariola, Jan Willem Klop

Inf. Comput., 1997

Confluent rewriting of bisimilar term graphs.

Zena M. Ariola, Jan Willem Klop, Detlef Plump

Proceedings of the International Workshop on Expressiveness in Concurrency, 1997

1996

Comparing Curried and Uncurried Rewriting.

Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries

J. Symb. Comput., 1996

Equational Term Graph Rewriting.

Zena M. Ariola, Jan Willem Klop

Fundam. Informaticae, 1996

Completing Partial Combinatory Algebras With Unique Head-Normal Forms.

Inge Bethke, Jan Willem Klop, Roel C. de Vrijer

Proceedings of the Proceedings, 1996

1995

Transfinite Reductions in Orthogonal Term Rewriting Systems

Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries

Inf. Comput., May, 1995

Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems.

Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt

J. ACM, 1995

Infinitary Lambda Calculi and Böhm Models.

Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries

Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Problems in Rewriting III.

Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop

Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Term Graph Rewriting.

Jan Willem Klop

Proceedings of the Higher-Order Algebra, 1995

Collapsing Partial Combinatory Algebras.

Inge Bethke, Jan Willem Klop

Proceedings of the Higher-Order Algebra, 1995

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

Modularity of Confluence: A Simplified Proof.

Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel C. de Vrijer

Inf. Process. Lett., 1994

Syntactic Definitions of Undefined: On Defining the Undefined.

Zena M. Ariola, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries

Proceedings of the Theoretical Aspects of Computer Software, 1994

Cyclic Lambda Graph Rewriting

Zena M. Ariola, Jan Willem Klop

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1993

Combinatory Reduction Systems: Introduction and Survey.

Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk

Theor. Comput. Sci., 1993

Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop

J. ACM, 1993

More Problems in Rewriting.

Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop

Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

1992

Asynchronous Communication in Process Algebra

Frank S. de Boer, Jan Willem Klop, Catuscia Palamidessi

Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1991

An Analysis of Loop Checking Mechanisms for Logic Programs.

Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop

Theor. Comput. Sci., 1991

Sequentiality in Orthogonal Term Rewriting Systems.

Jan Willem Klop, Aart Middeldorp

J. Symb. Comput., 1991

Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract).

Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

Open Problems in Rewriting.

Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990

Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond.

Jan Willem Klop

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

On the Power of Subsumption and Context Checks.

Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop

Proceedings of the Design and Implementation of Symbolic Computation Systems, 1990

Extended Term Rewriting Systems.

Jan Willem Klop, Roel C. de Vrijer

Proceedings of the Conditional and Typed Rewriting Systems, 1990

1989

Unique Normal Forms for Lambda Calculus with Surjective Pairing

Jan Willem Klop, Roel C. de Vrijer

Inf. Comput., February, 1989

Term-Rewriting Systems with Rule Priorities.

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland

Theor. Comput. Sci., 1989

Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-.

Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt

Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

On the Safe Termination of PROLOG Programs.

Krzysztof R. Apt, Roland N. Bol, Jan Willem Klop

Proceedings of the Logic Programming, 1989

1988

Readies and Failures in the Algebra of Communicating Processes.

Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog

SIAM J. Comput., 1988

Process theory based on bisimulation semantics.

Jan A. Bergstra, Jan Willem Klop

Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

1987

Needed Reduction and Spine Strategies for the Lambda Calculus

Hendrik Pieter Barendregt, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep

Inf. Comput., December, 1987

On the Consistency of Koomen's Fair Abstraction Rule.

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop

Theor. Comput. Sci., 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

Term Rewriting Systems with Priorities.

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop

Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

Failures without chaos: a new process semantics for fair abstraction.

Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog

Proceedings of the Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts, 1987

Conditional axioms and α/β-calculus in process algebra.

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop

Proceedings of the Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts, 1987

ACT_tau: A Universal Axiom System for Process Specification.

Jan A. Bergstra, Jan Willem Klop

Proceedings of the Algebraic Methods: Theory, 1987

1986

Conditional Rewrite Rules: Confluence and Termination.

Jan A. Bergstra, Jan Willem Klop

J. Comput. Syst. Sci., 1986

1985

Algebra of Communicating Processes with Abstraction.

Jan A. Bergstra, Jan Willem Klop

Theor. Comput. Sci., 1985

Verification of an alternating bit protocol by means of process algebra.

Jan A. Bergstra, Jan Willem Klop

Proceedings of the Mathematical Methods of Specification and Synthesis of Software Systems '85, 1985

1984

Proving Program Inclusion Using Hoare's Logic.

Jan A. Bergstra, Jan Willem Klop

Theor. Comput. Sci., 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

Process Algebra for Synchronous Communication

Jan A. Bergstra, Jan Willem Klop

Inf. Control., 1984

The Algebra of Recursively Defined Processes and the Algebra of Regular Processes.

Jan A. Bergstra, Jan Willem Klop

Proceedings of the Automata, 1984

Process Algebra with Asynchronous Communication Mechanisms.

Jan A. Bergstra, Jan Willem Klop, John V. Tucker

Proceedings of the Seminar on Concurrency, 1984

1983

A proof rule for restoring logic circuits.

Jan A. Bergstra, Jan Willem Klop

Integr., 1983

Initial Algebra Specifications for Parametrized Data Types.

Jan A. Bergstra, Jan Willem Klop

J. Inf. Process. Cybern., 1983

Algebraic Tools for System Construction.

Jan A. Bergstra, Jan Willem Klop, John V. Tucker

Proceedings of the Logics of Programs, 1983

1982

Strong Normalization and Perpetual Reductions in the Lambda Calculus.

Jan A. Bergstra, Jan Willem Klop

J. Inf. Process. Cybern., 1982

A formalized proof system for total correctness of while programs.

Jan A. Bergstra, Jan Willem Klop

Proceedings of the International Symposium on Programming, 1982

Formal Proof Systems for Program Equivalence.

Jan A. Bergstra, Jan Willem Klop

Proceedings of the Formal Description of Programming Concepts : Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts- II, 1982

Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras.

Jan A. Bergstra, Jan Willem Klop

Proceedings of the Automata, 1982

1981

Correctness of Programs with Function Procedures.

J. W. de Bakker, Jan Willem Klop, John-Jules Ch. Meyer

Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

1980

Invertible Terms in the Lambda Calculus.

Jan A. Bergstra, Jan Willem Klop

Theor. Comput. Sci., 1980

Combinatory reduction systems.

Jan Willem Klop

PhD thesis, 1980

1979

Church-Rosser Strategies in the Lambda Calculus.

Jan A. Bergstra, Jan Willem Klop

Theor. Comput. Sci., 1979

1978

Degrees of Sensible Lambda Theories.

Henk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken

J. Symb. Log., 1978

1975

On solvability by lambda I - terms.

Jan Willem Klop

Proceedings of the Lambda-Calculus and Computer Science Theory, 1975