default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Willem Klop
Person information
- affiliation: VU University Amsterdam, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j52]Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Star Games and Hydras. Log. Methods Comput. Sci. 17(2) (2021)- 2020
- [j51]Jörg Endrullis
, Jan Willem Klop, Rena Bakhshi:
Transducer degrees: atoms, infima and suprema. Acta Informatica 57(3-5): 727-758 (2020) - [j50]Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Decreasing Diagrams for Confluence and Commutation. Log. Methods Comput. Sci. 16(1) (2020) - [i9]Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Star Games and Hydras. CoRR abs/2001.08478 (2020)
2010 – 2019
- 2019
- [j49]Jörg Endrullis, Jan Willem Klop:
Braids via term rewriting. Theor. Comput. Sci. 777: 260-295 (2019) - [c51]Jörg Endrullis, Jan Willem Klop:
Confluence of the Chinese Monoid. The Art of Modelling Computational Systems 2019: 206-220 - [i8]Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Decreasing Diagrams for Confluence and Commutation. CoRR abs/1901.10773 (2019) - 2018
- [j48]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): 825-843 (2018) - [c50]Jörg Endrullis, Jan Willem Klop, Roy Overbeek:
Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems. FSCD 2018: 14:1-14:15 - [i7]Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela:
Degrees of Infinite Words, Polynomials, and Atoms (Extended Version). CoRR abs/1803.03158 (2018) - 2017
- [j47]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky:
Clocked lambda calculus. Math. Struct. Comput. Sci. 27(5): 782-806 (2017) - 2016
- [c49]Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela:
Degrees of Infinite Words, Polynomials and Atoms. DLT 2016: 164-176 - 2015
- [c48]Jörg Endrullis, Jan Willem Klop, Aleksi Saarela, Markus A. Whiteland:
Degrees of Transducibility. WORDS 2015: 1-13 - 2014
- [j46]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) - [j45]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky:
Discriminating Lambda-Terms Using Clocked Boehm Trees. Log. Methods Comput. Sci. 10(2) (2014) - [i6]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky:
An Introduction to the Clocked Lambda Calculus. CoRR abs/1405.7500 (2014) - 2013
- [j44]Jan A. Bergstra, Jan Willem Klop, Jan Rutten:
Obituary for Jaco de Bakker, 1939-2012. Bull. EATCS 109: 14-16 (2013) - [j43]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Streams are Forever. Bull. EATCS 109: 70-106 (2013) - [c47]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Andrew Polonsky:
Clocks for Functional Programs. The Beauty of Functional Code 2013: 97-126 - 2012
- [j42]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Highlights in infinitary rewriting and lambda calculus. Theor. Comput. Sci. 464: 48-71 (2012) - [c46]Jan Willem Klop:
Term Rewriting and Lambda Calculus. LICS 2012: 12 - [c45]Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss:
Automatic Sequences and Zip-Specifications. LICS 2012: 335-344 - [i5]Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss:
Automatic Sequences and Zip-Specifications. CoRR abs/1201.3251 (2012) - [i4]Dimitri Hendriks, Frits Dannenberg, Jörg Endrullis, Mark Dow, Jan Willem Klop:
Arithmetic Self-Similarity of Infinite Sequences. CoRR abs/1201.3786 (2012) - 2011
- [j41]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Degrees of Streams. Integers 11B: A6 (2011) - [j40]Jörg Endrullis, Clemens Grabmayer, Jan Willem Klop, Vincent van Oostrom:
On equal μ-terms. Theor. Comput. Sci. 412(28): 3175-3202 (2011) - [j39]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) - 2010
- [j38]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) - [c44]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Modular Construction of Fixed Point Combinators and Clocked Bohm Trees. LICS 2010: 111-119 - [c43]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 - [i3]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Modular Construction of Fixed Point Combinators and Clocked Boehm Trees. CoRR abs/1002.2578 (2010)
2000 – 2009
- 2009
- [j37]Henk Barendregt, Jan Willem Klop:
Applications of infinitary lambda calculus. Inf. Comput. 207(5): 559-582 (2009) - [i2]Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Let's Make a Difference! CoRR abs/0911.1004 (2009) - [i1]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop:
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting. CoRR abs/0911.1009 (2009) - 2008
- [j36]Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer:
Lambda calculus with patterns. Theor. Comput. Sci. 398(1-3): 16-31 (2008) - [c42]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Jan Willem Klop, Roel C. de Vrijer:
Proving Infinitary Normalization. TYPES 2008: 64-82 - 2007
- [c41]Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk:
Reduction Strategies and Acyclicity. Rewriting, Computation and Proof 2007: 89-112 - [c40]Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop:
Productivity of Stream Definitions. FCT 2007: 274-287 - 2006
- [c39]Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer:
Iterative Lexicographic Path Orders. Essays Dedicated to Joseph A. Goguen 2006: 541-554 - [c38]Clemens Grabmayer, Jan Willem Klop, Bas Luttik:
Some Remarks on Definability of Process Graphs. CONCUR 2006: 16-36 - 2005
- [c37]Jan Willem Klop, Roel C. de Vrijer:
Infinitary Normalization. We Will Show Them! (2) 2005: 169-192 - [c36]Clemens Grabmayer, Jan Willem Klop, Bas Luttik:
Reflections on a Geometry of Processes. APC 25 2005: 183-190 - 2004
- [c35]Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom:
Vicious Circles in Orthogonal Term Rewriting Systems. WRS 2004: 65-77 - 2000
- [j35]Zena M. Ariola, Jan Willem Klop, Detlef Plump:
Bisimilarity in Term Graph Rewriting. Inf. Comput. 156(1-2): 2-24 (2000) - [j34]Inge Bethke, Jan Willem Klop, Roel C. de Vrijer:
Descendants and Origins in Term Rewriting. Inf. Comput. 159(1-2): 59-124 (2000) - [j33]Fairouz Kamareddine, Jan Willem Klop:
Editorial. J. Log. Comput. 10(3): 321-322 (2000) - [j32]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)
1990 – 1999
- 1999
- [j31]Inge Bethke, Jan Willem Klop, Roel C. de Vrijer:
Extending partial combinatory algebras. Math. Struct. Comput. Sci. 9(4): 483-505 (1999) - 1998
- [j30]Marc Bezem, Jan Willem Klop, Vincent van Oostrom:
Diagram Techniques for Confluence. Inf. Comput. 141(2): 172-204 (1998) - [c34]Jan Willem Klop:
Origin Tracking in Term Rewriting (Abstract). RTA 1998: 1 - 1997
- [j29]Zena M. Ariola, Jan Willem Klop:
Lambda Calculus with Explicit Recursion. Inf. Comput. 139(2): 154-233 (1997) - [j28]Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
Infinitary Lambda Calculus. Theor. Comput. Sci. 175(1): 93-125 (1997) - [c33]Zena M. Ariola, Jan Willem Klop, Detlef Plump:
Confluent rewriting of bisimilar term graphs. EXPRESS 1997: 19 - 1996
- [j27]Zena M. Ariola, Jan Willem Klop:
Equational Term Graph Rewriting. Fundam. Informaticae 26(3/4): 207-240 (1996) - [j26]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) - [c32]Inge Bethke, Jan Willem Klop, Roel C. de Vrijer:
Completing Partial Combinatory Algebras With Unique Head-Normal Forms. LICS 1996: 448-454 - 1995
- [j25]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) - [j24]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) - [c31]Jan Willem Klop:
Term Graph Rewriting. HOA 1995: 1-16 - [c30]Inge Bethke, Jan Willem Klop:
Collapsing Partial Combinatory Algebras. HOA 1995: 57-73 - [c29]Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
Infinitary Lambda Calculi and Böhm Models. RTA 1995: 257-270 - [c28]Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop:
Problems in Rewriting III. RTA 1995: 457-471 - 1994
- [j23]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) - [j22]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) - [c27]Zena M. Ariola, Jan Willem Klop:
Cyclic Lambda Graph Rewriting. LICS 1994: 416-425 - [c26]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 - 1993
- [j21]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) - [j20]Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk:
Combinatory Reduction Systems: Introduction and Survey. Theor. Comput. Sci. 121(1&2): 279-308 (1993) - [c25]Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop:
More Problems in Rewriting. RTA 1993: 468-487 - 1992
- [c24]Frank S. de Boer, Jan Willem Klop, Catuscia Palamidessi:
Asynchronous Communication in Process Algebra. LICS 1992: 137-147 - 1991
- [j19]Jan Willem Klop, Aart Middeldorp:
Sequentiality in Orthogonal Term Rewriting Systems. J. Symb. Comput. 12(2): 161-196 (1991) - [j18]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) - [c23]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 - [c22]Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop:
Open Problems in Rewriting. RTA 1991: 445-456 - 1990
- [c21]Jan Willem Klop, Roel C. de Vrijer:
Extended Term Rewriting Systems. CTRS 1990: 26-50 - [c20]Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop:
On the Power of Subsumption and Context Checks. DISCO 1990: 131-140 - [c19]Jan Willem Klop:
Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond. ICALP 1990: 350-369 - [e1]Jos C. M. Baeten, Jan Willem Klop:
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 [contents]
1980 – 1989
- 1989
- [j17]Jan Willem Klop, Roel C. de Vrijer:
Unique Normal Forms for Lambda Calculus with Surjective Pairing. Inf. Comput. 80(2): 97-113 (1989) - [j16]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) - [c18]Krzysztof R. Apt, Roland N. Bol, Jan Willem Klop:
On the Safe Termination of PROLOG Programs. ICLP 1989: 353-368 - [c17]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 - 1988
- [j15]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) - [c16]Jan A. Bergstra, Jan Willem Klop:
Process theory based on bisimulation semantics. REX Workshop 1988: 50-122 - 1987
- [j14]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) - [j13]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) - [j12]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) - [c15]Jan A. Bergstra, Jan Willem Klop:
ACTtau: A Universal Axiom System for Process Specification. Algebraic Methods 1987: 447-463 - [c14]Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
Conditional axioms and α/β-calculus in process algebra. Formal Description of Programming Concepts 1987: 53-76 - [c13]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: 77-104 - [c12]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 - [c11]Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
Term Rewriting Systems with Priorities. RTA 1987: 83-94 - 1986
- [j11]Jan A. Bergstra, Jan Willem Klop:
Conditional Rewrite Rules: Confluence and Termination. J. Comput. Syst. Sci. 32(3): 323-362 (1986) - 1985
- [j10]Jan A. Bergstra, Jan Willem Klop:
Algebra of Communicating Processes with Abstraction. Theor. Comput. Sci. 37: 77-121 (1985) - [c10]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 - 1984
- [j9]Jan A. Bergstra, Jan Willem Klop:
Process Algebra for Synchronous Communication. Inf. Control. 60(1-3): 109-137 (1984) - [j8]Jan A. Bergstra, Jan Willem Klop:
Proving Program Inclusion Using Hoare's Logic. Theor. Comput. Sci. 30: 1-48 (1984) - [j7]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) - [c9]Jan A. Bergstra, Jan Willem Klop, John V. Tucker:
Process Algebra with Asynchronous Communication Mechanisms. Seminar on Concurrency 1984: 76-95 - [c8]Jan A. Bergstra, Jan Willem Klop:
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. ICALP 1984: 82-94 - 1983
- [j6]Jan A. Bergstra, Jan Willem Klop:
Initial Algebra Specifications for Parametrized Data Types. J. Inf. Process. Cybern. 19(1/2): 17-31 (1983) - [j5]Jan A. Bergstra, Jan Willem Klop:
A proof rule for restoring logic circuits. Integr. 1(2-3): 161-178 (1983) - [c7]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 - [c6]Jan A. Bergstra, Jan Willem Klop, John V. Tucker:
Algebraic Tools for System Construction. Logic of Programs 1983: 34-44 - 1982
- [j4]Jan A. Bergstra, Jan Willem Klop:
Strong Normalization and Perpetual Reductions in the Lambda Calculus. J. Inf. Process. Cybern. 18(7/8): 403-417 (1982) - [c5]Jan A. Bergstra, Jan Willem Klop:
Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. ICALP 1982: 23-34 - [c4]Jan A. Bergstra, Jan Willem Klop:
Formal Proof Systems for Program Equivalence. Formal Description of Programming Concepts 1982: 289-304 - [c3]Jan A. Bergstra, Jan Willem Klop:
A formalized proof system for total correctness of while programs. Symposium on Programming 1982: 26-36 - 1981
- [c2]J. W. de Bakker, Jan Willem Klop, John-Jules Ch. Meyer:
Correctness of Programs with Function Procedures. Logic of Programs 1981: 94-112 - 1980
- [b1]Jan Willem Klop:
Combinatory reduction systems. Univ. Utrecht, 1980, pp. I-XIII, 1-323 - [j3]Jan A. Bergstra, Jan Willem Klop:
Invertible Terms in the Lambda Calculus. Theor. Comput. Sci. 11: 19-37 (1980)
1970 – 1979
- 1979
- [j2]Jan A. Bergstra, Jan Willem Klop:
Church-Rosser Strategies in the Lambda Calculus. Theor. Comput. Sci. 9: 27-38 (1979) - 1978
- [j1]Henk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken:
Degrees of Sensible Lambda Theories. J. Symb. Log. 43(1): 45-55 (1978) - 1975
- [c1]Jan Willem Klop:
On solvability by lambda I - terms. Lambda-Calculus and Computer Science Theory 1975: 342-345
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
