@article{KennawayKSV94, title = {On the Adequacy of Graph Rewriting for Simulating Term Rewriting}, author = {Richard Kennaway and Jan Willem Klop and M. Ronan Sleep and Fer-Jan de Vries}, year = {1994}, doi = {10.1145/177492.177577}, url = {http://doi.acm.org/10.1145/177492.177577}, tags = {term rewriting, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/KennawayKSV94}, cites = {0}, citedby = {0}, journal = {TOPLAS}, volume = {16}, number = {3}, pages = {493-523}, } @inproceedings{BergstraK85:0, title = {Verification of an alternating bit protocol by means of process algebra}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1985}, tags = {protocol, process algebra, algebra}, researchr = {https://researchr.org/publication/BergstraK85%3A0}, cites = {0}, citedby = {0}, pages = {9-23}, booktitle = {aii}, } @article{BarendregtBKV78, title = {Degrees of Sensible Lambda Theories}, author = {Henk Barendregt and Jan A. Bergstra and Jan Willem Klop and Henri Volken}, year = {1978}, researchr = {https://researchr.org/publication/BarendregtBKV78}, cites = {0}, citedby = {0}, journal = {JSYML}, volume = {43}, number = {1}, pages = {45-55}, } @article{BergstraK82, title = {Strong Normalization and Perpetual Reductions in the Lambda Calculus}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1982}, researchr = {https://researchr.org/publication/BergstraK82}, cites = {0}, citedby = {0}, journal = {eik}, volume = {18}, number = {7/8}, pages = {403-417}, } @article{BaetenBK87:2, title = {Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator}, author = {Jos C. M. Baeten and Jan A. Bergstra and Jan Willem Klop}, year = {1987}, tags = {semantics, process algebra, C++, algebra}, researchr = {https://researchr.org/publication/BaetenBK87%3A2}, cites = {0}, citedby = {0}, journal = {cj}, volume = {30}, number = {6}, pages = {498-506}, } @inproceedings{BergstraK88, title = {Process theory based on bisimulation semantics}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1988}, tags = {semantics, rule-based}, researchr = {https://researchr.org/publication/BergstraK88}, cites = {0}, citedby = {0}, pages = {50-122}, booktitle = {rex}, } @article{KennawayKSV97, title = {Infinitary Lambda Calculus}, author = {Richard Kennaway and Jan Willem Klop and M. Ronan Sleep and Fer-Jan de Vries}, year = {1997}, doi = {10.1016/S0304-3975(96)00171-5}, url = {http://dx.doi.org/10.1016/S0304-3975(96)00171-5}, researchr = {https://researchr.org/publication/KennawayKSV97}, cites = {0}, citedby = {0}, journal = {TCS}, volume = {175}, number = {1}, pages = {93-125}, } @inproceedings{DershowitzJK93, title = {More Problems in Rewriting}, author = {Nachum Dershowitz and Jean-Pierre Jouannaud and Jan Willem Klop}, year = {1993}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/DershowitzJK93}, cites = {0}, citedby = {0}, pages = {468-487}, booktitle = {RTA}, } @inproceedings{BakkerBKM83, title = {Linear Time and Branching Time Semantics for Recursion with Merge}, author = {J. W. de Bakker and Jan A. Bergstra and Jan Willem Klop and John-Jules Ch. Meyer}, year = {1983}, tags = {semantics}, researchr = {https://researchr.org/publication/BakkerBKM83}, cites = {0}, citedby = {0}, pages = {39-51}, booktitle = {icalp}, } @article{BaetenBKW89, title = {Term-Rewriting Systems with Rule Priorities}, author = {Jos C. M. Baeten and Jan A. Bergstra and Jan Willem Klop and W. P. Weijland}, year = {1989}, tags = {rule-based, term rewriting, graph-rewriting, rules, C++, rewriting}, researchr = {https://researchr.org/publication/BaetenBKW89}, cites = {0}, citedby = {0}, journal = {TCS}, volume = {67}, number = {2&3}, pages = {283-301}, } @article{BergstraKO88, title = {Readies and Failures in the Algebra of Communicating Processes}, author = {Jan A. Bergstra and Jan Willem Klop and Ernst-Rüdiger Olderog}, year = {1988}, tags = {process algebra, algebra}, researchr = {https://researchr.org/publication/BergstraKO88}, cites = {0}, citedby = {0}, journal = {SICOMP}, volume = {17}, number = {6}, pages = {1134-1177}, } @article{KlopM91, title = {Sequentiality in Orthogonal Term Rewriting Systems}, author = {Jan Willem Klop and Aart Middeldorp}, year = {1991}, tags = {term rewriting, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/KlopM91}, cites = {0}, citedby = {0}, journal = {JSC}, volume = {12}, number = {2}, pages = {161-196}, } @article{KlopOV08, title = {Lambda calculus with patterns}, author = {Jan Willem Klop and Vincent van Oostrom and Roel C. de Vrijer}, year = {2008}, doi = {10.1016/j.tcs.2008.01.019}, url = {http://dx.doi.org/10.1016/j.tcs.2008.01.019}, tags = {C++}, researchr = {https://researchr.org/publication/KlopOV08}, cites = {0}, citedby = {0}, journal = {TCS}, volume = {398}, number = {1-3}, pages = {16-31}, } @inproceedings{AriolaK94, title = {Cyclic Lambda Graph Rewriting}, author = {Zena M. Ariola and Jan Willem Klop}, year = {1994}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/AriolaK94}, cites = {0}, citedby = {0}, pages = {416-425}, booktitle = {lics}, } @article{BolAK91, title = {An Analysis of Loop Checking Mechanisms for Logic Programs}, author = {Roland N. Bol and Krzysztof R. Apt and Jan Willem Klop}, year = {1991}, tags = {program analysis, analysis, logic programming, logic}, researchr = {https://researchr.org/publication/BolAK91}, cites = {0}, citedby = {0}, journal = {TCS}, volume = {86}, number = {1}, pages = {35-79}, } @inproceedings{BergstraKT84, title = {Process Algebra with Asynchronous Communication Mechanisms}, author = {Jan A. Bergstra and Jan Willem Klop and J. V. Tucker}, year = {1984}, tags = {process algebra, algebra}, researchr = {https://researchr.org/publication/BergstraKT84}, cites = {0}, citedby = {0}, pages = {76-95}, booktitle = {concur}, } @article{ToyamaKB95, title = {Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems}, author = {Yoshihito Toyama and Jan Willem Klop and Hendrik Pieter Barendregt}, year = {1995}, doi = {10.1145/227683.227689}, url = {http://doi.acm.org/10.1145/227683.227689}, tags = {completeness, term rewriting, termination, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/ToyamaKB95}, cites = {0}, citedby = {0}, journal = {JACM}, volume = {42}, number = {6}, pages = {1275-1304}, } @article{KlopOR93, title = {Combinatory Reduction Systems: Introduction and Survey}, author = {Jan Willem Klop and Vincent van Oostrom and Femke van Raamsdonk}, year = {1993}, tags = {survey}, researchr = {https://researchr.org/publication/KlopOR93}, cites = {0}, citedby = {0}, journal = {TCS}, volume = {121}, number = {1&2}, pages = {279-308}, } @inproceedings{BergstraK84:1, title = {The Algebra of Recursively Defined Processes and the Algebra of Regular Processes}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1984}, tags = {process algebra, algebra}, researchr = {https://researchr.org/publication/BergstraK84%3A1}, cites = {0}, citedby = {0}, pages = {82-94}, booktitle = {icalp}, } @inproceedings{BergstraKT83, title = {Algebraic Tools for System Construction}, author = {Jan A. Bergstra and Jan Willem Klop and J. V. Tucker}, year = {1983}, tags = { algebra}, researchr = {https://researchr.org/publication/BergstraKT83}, cites = {0}, citedby = {0}, pages = {34-44}, booktitle = {lop}, } @inproceedings{AriolaKKSV94, title = {Syntactic Definitions of Undefined: On Defining the Undefined}, author = {Zena M. Ariola and Richard Kennaway and Jan Willem Klop and M. Ronan Sleep and Fer-Jan de Vries}, year = {1994}, researchr = {https://researchr.org/publication/AriolaKKSV94}, cites = {0}, citedby = {0}, pages = {543-554}, booktitle = {tacs}, } @article{BergstraK80, title = {Invertible Terms in the Lambda Calculus}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1980}, researchr = {https://researchr.org/publication/BergstraK80}, cites = {0}, citedby = {0}, journal = {TCS}, volume = {11}, pages = {19-37}, } @inproceedings{BethkeKV96, title = {Completing Partial Combinatory Algebras With Unique Head-Normal Forms}, author = {Inge Bethke and Jan Willem Klop and Roel C. de Vrijer}, year = {1996}, tags = {completeness, C++, algebra}, researchr = {https://researchr.org/publication/BethkeKV96}, cites = {0}, citedby = {0}, pages = {448-454}, booktitle = {lics}, } @inproceedings{GrabmayerKL06:0, title = {Some Remarks on Definability of Process Graphs}, author = {Clemens Grabmayer and Jan Willem Klop and Bas Luttik}, year = {2006}, doi = {10.1007/11817949_2}, url = {http://dx.doi.org/10.1007/11817949_2}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/GrabmayerKL06%3A0}, cites = {0}, citedby = {0}, pages = {16-36}, booktitle = {concur}, } @article{BergstraK79, title = {Church-Rosser Strategies in the Lambda Calculus}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1979}, researchr = {https://researchr.org/publication/BergstraK79}, cites = {0}, citedby = {0}, journal = {TCS}, volume = {9}, pages = {27-38}, } @inproceedings{BergstraK87, title = {ACT::tau::: A Universal Axiom System for Process Specification}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1987}, researchr = {https://researchr.org/publication/BergstraK87}, cites = {0}, citedby = {0}, pages = {447-463}, booktitle = {am}, } @article{KlopOV00, title = {A geometric proof of confluence by decreasing diagrams}, author = {Jan Willem Klop and Vincent van Oostrom and Roel C. de Vrijer}, year = {2000}, tags = {C++}, researchr = {https://researchr.org/publication/KlopOV00}, cites = {0}, citedby = {0}, journal = {logcom}, volume = {10}, number = {3}, pages = {437-460}, } @article{AriolaK97, title = {Lambda Calculus with Explicit Recursion}, author = {Zena M. Ariola and Jan Willem Klop}, year = {1997}, researchr = {https://researchr.org/publication/AriolaK97}, cites = {0}, citedby = {0}, journal = {iandc}, volume = {139}, number = {2}, pages = {154-233}, } @inproceedings{BaetenBK87:1, title = {Term Rewriting Systems with Priorities}, author = {Jos C. M. Baeten and Jan A. Bergstra and Jan Willem Klop}, year = {1987}, tags = {term rewriting, graph-rewriting, C++, rewriting}, researchr = {https://researchr.org/publication/BaetenBK87%3A1}, cites = {0}, citedby = {0}, pages = {83-94}, booktitle = {RTA}, } @inproceedings{BergstraK82:0, title = {Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1982}, tags = {data-flow, algebraic specification, algebra}, researchr = {https://researchr.org/publication/BergstraK82%3A0}, cites = {0}, citedby = {0}, pages = {23-34}, booktitle = {icalp}, } @inproceedings{EndrullisGHIK07, title = {Productivity of Stream Definitions}, author = {Jörg Endrullis and Clemens Grabmayer and Dimitri Hendriks and Ariya Isihara and Jan Willem Klop}, year = {2007}, doi = {10.1007/978-3-540-74240-1_24}, url = {http://dx.doi.org/10.1007/978-3-540-74240-1_24}, researchr = {https://researchr.org/publication/EndrullisGHIK07}, cites = {0}, citedby = {0}, pages = {274-287}, booktitle = {fct}, } @inproceedings{Klop95, title = {Term Graph Rewriting}, author = {Jan Willem Klop}, year = {1995}, tags = {term rewriting, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/Klop95}, cites = {0}, citedby = {0}, pages = {1-16}, booktitle = {hoa}, } @inproceedings{BakkerKM81, title = {Correctness of Programs with Function Procedures}, author = {J. W. de Bakker and Jan Willem Klop and John-Jules Ch. Meyer}, year = {1981}, researchr = {https://researchr.org/publication/BakkerKM81}, cites = {0}, citedby = {0}, pages = {94-112}, booktitle = {lop}, } @inproceedings{DershowitzJK91, title = {Open Problems in Rewriting}, author = {Nachum Dershowitz and Jean-Pierre Jouannaud and Jan Willem Klop}, year = {1991}, tags = {source-to-source, graph-rewriting, rewriting, open-source}, researchr = {https://researchr.org/publication/DershowitzJK91}, cites = {0}, citedby = {0}, pages = {445-456}, booktitle = {RTA}, } @article{BergstraK86, title = {Conditional Rewrite Rules: Confluence and Termination}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1986}, tags = {rule-based, termination, graph-rewriting, rules, rewriting}, researchr = {https://researchr.org/publication/BergstraK86}, cites = {0}, citedby = {0}, journal = {jcss}, volume = {32}, number = {3}, pages = {323-362}, } @article{BergstraK83, title = {Initial Algebra Specifications for Parametrized Data Types}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1983}, tags = {data-flow, algebraic specification, algebra}, researchr = {https://researchr.org/publication/BergstraK83}, cites = {0}, citedby = {0}, journal = {eik}, volume = {19}, number = {1/2}, pages = {17-31}, } @inproceedings{Klop90, title = {Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond}, author = {Jan Willem Klop}, year = {1990}, tags = {term rewriting, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/Klop90}, cites = {0}, citedby = {0}, pages = {350-369}, booktitle = {icalp}, } @inproceedings{BergstraK82:1, title = {A formalized proof system for total correctness of while programs}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1982}, researchr = {https://researchr.org/publication/BergstraK82%3A1}, cites = {0}, citedby = {0}, pages = {26-36}, booktitle = {programm}, } @article{BaetenBK93, title = {Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages}, author = {Jos C. M. Baeten and Jan A. Bergstra and Jan Willem Klop}, year = {1993}, doi = {10.1145/174130.174141}, url = {http://doi.acm.org/10.1145/174130.174141}, tags = {C++, context-aware}, researchr = {https://researchr.org/publication/BaetenBK93}, cites = {0}, citedby = {0}, journal = {JACM}, volume = {40}, number = {3}, pages = {653-682}, } @article{KetemaKO05, title = {Vicious Circles in Orthogonal Term Rewriting Systems}, author = {Jeroen Ketema and Jan Willem Klop and Vincent van Oostrom}, year = {2005}, doi = {10.1016/j.entcs.2004.11.020}, url = {http://dx.doi.org/10.1016/j.entcs.2004.11.020}, tags = {term rewriting, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/KetemaKO05}, cites = {0}, citedby = {0}, journal = {ENTCS}, volume = {124}, number = {2}, pages = {65-77}, } @article{BergstraK84, title = {Proving Program Inclusion Using Hoare s Logic}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1984}, tags = {logic programming, logic}, researchr = {https://researchr.org/publication/BergstraK84}, cites = {0}, citedby = {0}, journal = {TCS}, volume = {30}, pages = {1-48}, } @inproceedings{BaetenBK87:0, title = {Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages}, author = {Jos C. M. Baeten and Jan A. Bergstra and Jan Willem Klop}, year = {1987}, tags = {C++, context-aware}, researchr = {https://researchr.org/publication/BaetenBK87%3A0}, cites = {0}, citedby = {0}, pages = {94-111}, booktitle = {parle}, } @article{KlopV89, title = {Unique Normal Forms for Lambda Calculus with Surjective Pairing}, author = {Jan Willem Klop and Roel C. de Vrijer}, year = {1989}, month = {February}, tags = {C++}, researchr = {https://researchr.org/publication/KlopV89}, cites = {0}, citedby = {0}, journal = {iandc}, volume = {80}, number = {2}, pages = {97-113}, } @inproceedings{EndrullisGHKV08, title = {Proving Infinitary Normalization}, author = {Jörg Endrullis and Clemens Grabmayer and Dimitri Hendriks and Jan Willem Klop and Roel C. de Vrijer}, year = {2008}, doi = {10.1007/978-3-642-02444-3_5}, url = {http://dx.doi.org/10.1007/978-3-642-02444-3_5}, tags = {C++}, researchr = {https://researchr.org/publication/EndrullisGHKV08}, cites = {0}, citedby = {0}, pages = {64-82}, booktitle = {TYPES}, } @article{BaetenBK87, title = {On the Consistency of Koomen s Fair Abstraction Rule}, author = {Jos C. M. Baeten and Jan A. Bergstra and Jan Willem Klop}, year = {1987}, tags = {rule-based, rules, C++, consistency, abstraction}, researchr = {https://researchr.org/publication/BaetenBK87}, cites = {0}, citedby = {0}, journal = {TCS}, volume = {51}, pages = {129-176}, } @article{BergstraK84:0, title = {Process Algebra for Synchronous Communication}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1984}, month = {January/February/March}, tags = {process algebra, algebra}, researchr = {https://researchr.org/publication/BergstraK84%3A0}, cites = {0}, citedby = {0}, journal = {iandc}, volume = {60}, number = {1-3}, pages = {109-137}, } @article{BergstraK85, title = {Algebra of Communicating Processes with Abstraction}, author = {Jan A. Bergstra and Jan Willem Klop}, year = {1985}, tags = {process algebra, algebra, abstraction}, researchr = {https://researchr.org/publication/BergstraK85}, cites = {0}, citedby = {0}, journal = {TCS}, volume = {37}, pages = {77-121}, } @article{BakkerBKM84, title = {Linear Time and Branching Time Semantics for Recursion with Merge}, author = {J. W. de Bakker and Jan A. Bergstra and Jan Willem Klop and John-Jules Ch. Meyer}, year = {1984}, tags = {semantics}, researchr = {https://researchr.org/publication/BakkerBKM84}, cites = {0}, citedby = {0}, journal = {TCS}, volume = {34}, pages = {135-156}, } @inproceedings{KlopV90, title = {Extended Term Rewriting Systems}, author = {Jan Willem Klop and Roel C. de Vrijer}, year = {1990}, tags = {term rewriting, graph-rewriting, C++, rewriting}, researchr = {https://researchr.org/publication/KlopV90}, cites = {0}, citedby = {0}, pages = {26-50}, booktitle = {ctrs}, } @inproceedings{AptBK89, title = {On the Safe Termination of PROLOG Programs}, author = {Krzysztof R. Apt and Roland N. Bol and Jan Willem Klop}, year = {1989}, tags = {Prolog, termination}, researchr = {https://researchr.org/publication/AptBK89}, cites = {0}, citedby = {0}, pages = {353-368}, booktitle = {ICLP}, }