Jan Willem Klop

114 papers A* 10B 5C 1Journal 61Unranked 36

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Star Games and Hydras. Log. Methods Comput. Sci. Jörg Endrullis, Jan Willem Klop, Roy Overbeek
2020	J	`jnl`	Decreasing Diagrams for Confluence and Commutation. Log. Methods Comput. Sci. Jörg Endrullis, Jan Willem Klop, Roy Overbeek
2020	J	`jnl`	Star Games and Hydras. CoRR Jörg Endrullis, Jan Willem Klop, Roy Overbeek
2020	J	`jnl`	Transducer degrees: atoms, infima and suprema. Acta Informatica Jörg Endrullis, Jan Willem Klop, Rena Bakhshi
2019	J	`jnl`	Braids via term rewriting. Theor. Comput. Sci. Jörg Endrullis, Jan Willem Klop
2019	—	`conf`	Confluence of the Chinese Monoid. The Art of Modelling Computational Systems Jörg Endrullis, Jan Willem Klop
2019	J	`jnl`	Decreasing Diagrams for Confluence and Commutation. CoRR Jörg Endrullis, Jan Willem Klop, Roy Overbeek
2018	B	`conf`	Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems. FSCD Jörg Endrullis, Jan Willem Klop, Roy Overbeek
2018	J	`jnl`	Degrees of Infinite Words, Polynomials and Atoms. Int. J. Found. Comput. Sci. Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
2018	J	`jnl`	Degrees of Infinite Words, Polynomials, and Atoms (Extended Version). CoRR Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
2017	J	`jnl`	Clocked lambda calculus. Math. Struct. Comput. Sci. Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky
2016	C	`conf`	Degrees of Infinite Words, Polynomials and Atoms. DLT Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
2015	—	`conf`	Degrees of Transducibility. WORDS Jörg Endrullis, Jan Willem Klop, Aleksi Saarela, Markus A. Whiteland
2014	J	`jnl`	An Introduction to the Clocked Lambda Calculus. CoRR Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky
2014	J	`jnl`	Discriminating Lambda-Terms Using Clocked Boehm Trees Log. Methods Comput. Sci. Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky
2014	J	`jnl`	Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples. Log. Methods Comput. Sci. Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom
2013	—	`conf`	Clocks for Functional Programs. The Beauty of Functional Code Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky
2013	J	`jnl`	Obituary for Jaco de Bakker, 1939-2012. Bull. EATCS Jan A. Bergstra, Jan Willem Klop, Jan Rutten
2013	J	`jnl`	Streams are Forever. Bull. EATCS Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
2012	J	`jnl`	Arithmetic Self-Similarity of Infinite Sequences. CoRR Dimitri Hendriks, Frits Dannenberg, Jörg Endrullis, Mark Dow, Jan Willem Klop
2012	J	`jnl`	Automatic Sequences and Zip-Specifications CoRR Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss
2012	A*	`conf`	Automatic Sequences and Zip-Specifications. LICS Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss
2012	J	`jnl`	Highlights in infinitary rewriting and lambda calculus. Theor. Comput. Sci. Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
2012	A*	`conf`	Term Rewriting and Lambda Calculus. LICS Jan Willem Klop
2011	J	`jnl`	Degrees of Streams. Integers Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
2011	J	`jnl`	On equal μ-terms. Theor. Comput. Sci. Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, Vincent van Oostrom
2011	J	`jnl`	The free process algebra generated by δ, ϵ and τ. Theor. Comput. Sci. Piet Rodenburg, Jan Willem Klop, Karst Koymans, Jos L. M. Vrancken
2010	J	`jnl`	Modular Construction of Fixed Point Combinators and Clocked Boehm Trees CoRR Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
2010	A*	`conf`	Modular Construction of Fixed Point Combinators and Clocked Bohm Trees. LICS Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
2010	J	`jnl`	Productivity of stream definitions. Theor. Comput. Sci. Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop
2010	—	`conf`	Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. RTA Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Vincent van Oostrom
2009	J	`jnl`	Applications of infinitary lambda calculus. Inf. Comput. Henk Barendregt, Jan Willem Klop
2009	J	`jnl`	Let's Make a Difference! CoRR Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop
2009	J	`jnl`	Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting CoRR Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop
2008	J	`jnl`	Lambda calculus with patterns. Theor. Comput. Sci. Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
2008	—	`conf`	Proving Infinitary Normalization. TYPES Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel C. de Vrijer
2007	B	`conf`	Productivity of Stream Definitions. FCT Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop
2007	—	`conf`	Reduction Strategies and Acyclicity. Rewriting, Computation and Proof Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk
2006	—	`conf`	Iterative Lexicographic Path Orders. Essays Dedicated to Joseph A. Goguen Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
2006	B	`conf`	Some Remarks on Definability of Process Graphs. CONCUR Clemens Grabmayer, Jan Willem Klop, Bas Luttik
2005	—	`conf`	Infinitary Normalization. We Will Show Them! (2) Jan Willem Klop, Roel C. de Vrijer
2005	—	`conf`	Reflections on a Geometry of Processes. APC 25 Clemens Grabmayer, Jan Willem Klop, Bas Luttik
2004	—	`conf`	Vicious Circles in Orthogonal Term Rewriting Systems. WRS Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom
2000	J	`jnl`	A geometric proof of confluence by decreasing diagrams. J. Log. Comput. Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
2000	J	`jnl`	Bisimilarity in Term Graph Rewriting. Inf. Comput. Zena M. Ariola, Jan Willem Klop, Detlef Plump
2000	J	`jnl`	Descendants and Origins in Term Rewriting. Inf. Comput. Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
2000	J	`jnl`	Editorial. J. Log. Comput. Fairouz Kamareddine, Jan Willem Klop
1999	J	`jnl`	Extending partial combinatory algebras. Math. Struct. Comput. Sci. Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
1998	J	`jnl`	Diagram Techniques for Confluence. Inf. Comput. Marc Bezem, Jan Willem Klop, Vincent van Oostrom
1998	—	`conf`	Origin Tracking in Term Rewriting (Abstract). RTA Jan Willem Klop
1997	—	`conf`	Confluent rewriting of bisimilar term graphs. EXPRESS Zena M. Ariola, Jan Willem Klop, Detlef Plump
1997	J	`jnl`	Infinitary Lambda Calculus. Theor. Comput. Sci. Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
1997	J	`jnl`	Lambda Calculus with Explicit Recursion. Inf. Comput. Zena M. Ariola, Jan Willem Klop
1996	J	`jnl`	Comparing Curried and Uncurried Rewriting. J. Symb. Comput. Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
1996	A*	`conf`	Completing Partial Combinatory Algebras With Unique Head-Normal Forms. LICS Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
1996	J	`jnl`	Equational Term Graph Rewriting. Fundam. Informaticae Zena M. Ariola, Jan Willem Klop
1995	—	`conf`	Collapsing Partial Combinatory Algebras. HOA Inge Bethke, Jan Willem Klop
1995	—	`conf`	Infinitary Lambda Calculi and Böhm Models. RTA Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
1995	—	`conf`	Problems in Rewriting III. RTA Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
1995	—	`conf`	Term Graph Rewriting. HOA Jan Willem Klop
1995	J	`jnl`	Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems. J. ACM Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt
1995	J	`jnl`	Transfinite Reductions in Orthogonal Term Rewriting Systems Inf. Comput. Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
1994	A*	`conf`	Cyclic Lambda Graph Rewriting LICS Zena M. Ariola, Jan Willem Klop
1994	J	`jnl`	Modularity of Confluence: A Simplified Proof. Inf. Process. Lett. Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel C. de Vrijer
1994	J	`jnl`	On the Adequacy of Graph Rewriting for Simulating Term Rewriting. ACM Trans. Program. Lang. Syst. Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
1994	—	`conf`	Syntactic Definitions of Undefined: On Defining the Undefined. TACS Zena M. Ariola, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
1993	J	`jnl`	Combinatory Reduction Systems: Introduction and Survey. Theor. Comput. Sci. Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk
1993	J	`jnl`	Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. J. ACM Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1993	—	`conf`	More Problems in Rewriting. RTA Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
1992	A*	`conf`	Asynchronous Communication in Process Algebra LICS Frank S. de Boer, Jan Willem Klop, Catuscia Palamidessi
1991	J	`jnl`	An Analysis of Loop Checking Mechanisms for Logic Programs. Theor. Comput. Sci. Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop
1991	—	`conf`	Open Problems in Rewriting. RTA Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
1991	J	`jnl`	Sequentiality in Orthogonal Term Rewriting Systems. J. Symb. Comput. Jan Willem Klop, Aart Middeldorp
1991	—	`conf`	Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract). RTA Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
1990	B	`ed.`	CONCUR '90, Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, August 27-30, 1990, Proceedings CONCUR Jos C. M. Baeten, Jan Willem Klop
1990	—	`conf`	Extended Term Rewriting Systems. CTRS Jan Willem Klop, Roel C. de Vrijer
1990	—	`conf`	On the Power of Subsumption and Context Checks. DISCO Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop
1990	A*	`conf`	Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond. ICALP Jan Willem Klop
1989	B	`conf`	On the Safe Termination of PROLOG Programs. ICLP Krzysztof R. Apt, Roland N. Bol, Jan Willem Klop
1989	J	`jnl`	Term-Rewriting Systems with Rule Priorities. Theor. Comput. Sci. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland
1989	—	`conf`	Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-. RTA Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt
1989	J	`jnl`	Unique Normal Forms for Lambda Calculus with Surjective Pairing Inf. Comput. Jan Willem Klop, Roel C. de Vrijer
1988	—	`conf`	Process theory based on bisimulation semantics. REX Workshop Jan A. Bergstra, Jan Willem Klop
1988	J	`jnl`	Readies and Failures in the Algebra of Communicating Processes. SIAM J. Comput. Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog
1987	—	`conf`	ACT Algebraic Methods Jan A. Bergstra, Jan Willem Klop
1987	—	`conf`	Conditional axioms and α/β-calculus in process algebra. Formal Description of Programming Concepts Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1987	—	`conf`	Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. PARLE (2) Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1987	—	`conf`	Failures without chaos: a new process semantics for fair abstraction. Formal Description of Programming Concepts Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog
1987	J	`jnl`	Needed Reduction and Spine Strategies for the Lambda Calculus Inf. Comput. Hendrik Pieter Barendregt, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep
1987	J	`jnl`	On the Consistency of Koomen's Fair Abstraction Rule. Theor. Comput. Sci. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1987	J	`jnl`	Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator. Comput. J. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1987	—	`conf`	Term Rewriting Systems with Priorities. RTA Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
1986	J	`jnl`	Conditional Rewrite Rules: Confluence and Termination. J. Comput. Syst. Sci. Jan A. Bergstra, Jan Willem Klop
1985	J	`jnl`	Algebra of Communicating Processes with Abstraction. Theor. Comput. Sci. Jan A. Bergstra, Jan Willem Klop
1985	—	`conf`	Verification of an alternating bit protocol by means of process algebra. Mathematical Methods of Specification and Synthesis of Software Systems Jan A. Bergstra, Jan Willem Klop
1984	J	`jnl`	Linear Time and Branching Time Semantics for Recursion with Merge. Theor. Comput. Sci. J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer
1984	J	`jnl`	Process Algebra for Synchronous Communication Inf. Control. Jan A. Bergstra, Jan Willem Klop
1984	—	`conf`	Process Algebra with Asynchronous Communication Mechanisms. Seminar on Concurrency Jan A. Bergstra, Jan Willem Klop, John V. Tucker
1984	J	`jnl`	Proving Program Inclusion Using Hoare's Logic. Theor. Comput. Sci. Jan A. Bergstra, Jan Willem Klop
1984	A*	`conf`	The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. ICALP Jan A. Bergstra, Jan Willem Klop
1983	J	`jnl`	A proof rule for restoring logic circuits. Integr. Jan A. Bergstra, Jan Willem Klop
1983	—	`conf`	Algebraic Tools for System Construction. Logic of Programs Jan A. Bergstra, Jan Willem Klop, John V. Tucker
1983	J	`jnl`	Initial Algebra Specifications for Parametrized Data Types. J. Inf. Process. Cybern. Jan A. Bergstra, Jan Willem Klop
1983	A*	`conf`	Linear Time and Branching Time Semantics for Recursion with Merge. ICALP J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer
1982	—	`conf`	A formalized proof system for total correctness of while programs. Symposium on Programming Jan A. Bergstra, Jan Willem Klop
1982	A*	`conf`	Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. ICALP Jan A. Bergstra, Jan Willem Klop
1982	—	`conf`	Formal Proof Systems for Program Equivalence. Formal Description of Programming Concepts Jan A. Bergstra, Jan Willem Klop
1982	J	`jnl`	Strong Normalization and Perpetual Reductions in the Lambda Calculus. J. Inf. Process. Cybern. Jan A. Bergstra, Jan Willem Klop
1981	—	`conf`	Correctness of Programs with Function Procedures. Logic of Programs J. W. de Bakker, Jan Willem Klop, John-Jules Ch. Meyer
1980	—	`—`	Combinatory reduction systems. Jan Willem Klop
1980	J	`jnl`	Invertible Terms in the Lambda Calculus. Theor. Comput. Sci. Jan A. Bergstra, Jan Willem Klop
1979	J	`jnl`	Church-Rosser Strategies in the Lambda Calculus. Theor. Comput. Sci. Jan A. Bergstra, Jan Willem Klop
1978	J	`jnl`	Degrees of Sensible Lambda Theories. J. Symb. Log. Henk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken
1975	—	`conf`	On solvability by lambda I - terms. Lambda-Calculus and Computer Science Theory Jan Willem Klop