The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan Willem Klop: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Krzysztof R. Apt, Roland N. Bol, Jan Willem Klop
    On the Safe Termination of PROLOG Programs. [Citation Graph (1, 0)][DBLP]
    ICLP, 1989, pp:353-368 [Conf]
  2. Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop
    An Analysis of Loop Checking Mechanisms for Logic Programs. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:86, n:1, pp:35-79 [Journal]
  3. Jan A. Bergstra, Jan Willem Klop
    Verification of an alternating bit protocol by means of process algebra. [Citation Graph (0, 0)][DBLP]
    Mathematical Methods of Specification and Synthesis of Software Systems, 1985, pp:9-23 [Conf]
  4. Jan A. Bergstra, Jan Willem Klop
    ACTtau: A Universal Axiom System for Process Specification. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods, 1987, pp:447-463 [Conf]
  5. Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
    Iterative Lexicographic Path Orders. [Citation Graph (0, 0)][DBLP]
    Essays Dedicated to Joseph A. Goguen, 2006, pp:541-554 [Conf]
  6. Jan Willem Klop, Roel C. de Vrijer
    Infinitary Normalization. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (2), 2005, pp:169-192 [Conf]
  7. Jan A. Bergstra, Jan Willem Klop, J. V. Tucker
    Process Algebra with Asynchronous Communication Mechanisms. [Citation Graph (0, 0)][DBLP]
    Seminar on Concurrency, 1984, pp:76-95 [Conf]
  8. Clemens Grabmayer, Jan Willem Klop, Bas Luttik
    Some Remarks on Definability of Process Graphs. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:16-36 [Conf]
  9. Jan Willem Klop, Roel C. de Vrijer
    Extended Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1990, pp:26-50 [Conf]
  10. Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop
    On the Power of Subsumption and Context Checks. [Citation Graph (0, 0)][DBLP]
    DISCO, 1990, pp:131-140 [Conf]
  11. Inge Bethke, Jan Willem Klop
    Collapsing Partial Combinatory Algebras. [Citation Graph (0, 0)][DBLP]
    HOA, 1995, pp:57-73 [Conf]
  12. Jan Willem Klop
    Term Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    HOA, 1995, pp:1-16 [Conf]
  13. J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer
    Linear Time and Branching Time Semantics for Recursion with Merge. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:39-51 [Conf]
  14. Jan A. Bergstra, Jan Willem Klop
    Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:23-34 [Conf]
  15. Jan A. Bergstra, Jan Willem Klop
    The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:82-94 [Conf]
  16. Jan Willem Klop
    Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:350-369 [Conf]
  17. Jan Willem Klop
    On solvability by lambda I - terms. [Citation Graph (0, 0)][DBLP]
    Lambda-Calculus and Computer Science Theory, 1975, pp:342-345 [Conf]
  18. Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
    Completing Partial Combinatory Algebras With Unique Head-Normal Forms. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:448-454 [Conf]
  19. Zena M. Ariola, Jan Willem Klop
    Cyclic Lambda Graph Rewriting [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:416-425 [Conf]
  20. Frank S. de Boer, Jan Willem Klop, Catuscia Palamidessi
    Asynchronous Communication in Process Algebra [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:137-147 [Conf]
  21. J. W. de Bakker, Jan Willem Klop, John-Jules Ch. Meyer
    Correctness of Programs with Function Procedures. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1981, pp:94-112 [Conf]
  22. Jan A. Bergstra, Jan Willem Klop, J. V. Tucker
    Algebraic Tools for System Construction. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1983, pp:34-44 [Conf]
  23. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1987, pp:94-111 [Conf]
  24. Jan A. Bergstra, Jan Willem Klop
    A formalized proof system for total correctness of while programs. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1982, pp:26-36 [Conf]
  25. Jan A. Bergstra, Jan Willem Klop
    Process theory based on bisimulation semantics. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1988, pp:50-122 [Conf]
  26. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    Term Rewriting Systems with Priorities. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:83-94 [Conf]
  27. Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
    Open Problems in Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:445-456 [Conf]
  28. Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
    More Problems in Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:468-487 [Conf]
  29. Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop
    Problems in Rewriting III. [Citation Graph (0, 0)][DBLP]
    RTA, 1995, pp:457-471 [Conf]
  30. Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
    Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:1-12 [Conf]
  31. Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
    Infinitary Lambda Calculi and Böhm Models. [Citation Graph (0, 0)][DBLP]
    RTA, 1995, pp:257-270 [Conf]
  32. Jan Willem Klop
    Origin Tracking in Term Rewriting (Abstract). [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:1- [Conf]
  33. Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt
    Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-. [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:477-491 [Conf]
  34. Zena M. Ariola, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
    Syntactic Definitions of Undefined: On Defining the Undefined. [Citation Graph (0, 0)][DBLP]
    TACS, 1994, pp:543-554 [Conf]
  35. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:6, pp:498-506 [Journal]
  36. Jan A. Bergstra, Jan Willem Klop
    Initial Algebra Specifications for Parametrized Data Types. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1983, v:19, n:1/2, pp:17-31 [Journal]
  37. Jan A. Bergstra, Jan Willem Klop
    Strong Normalization and Perpetual Reductions in the Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1982, v:18, n:7/8, pp:403-417 [Journal]
  38. Zena M. Ariola, Jan Willem Klop, Detlef Plump
    Confluent rewriting of bisimilar term graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:7, n:, pp:- [Journal]
  39. Jeroen Ketema, Jan Willem Klop, Vincent van Oostrom
    Vicious Circles in Orthogonal Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:124, n:2, pp:65-77 [Journal]
  40. Clemens Grabmayer, Jan Willem Klop, Bas Luttik
    Reflections on a Geometry of Processes. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:183-190 [Journal]
  41. Zena M. Ariola, Jan Willem Klop
    Equational Term Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:26, n:3/4, pp:207-240 [Journal]
  42. Zena M. Ariola, Jan Willem Klop, Detlef Plump
    Bisimilarity in Term Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:156, n:1-2, pp:2-24 [Journal]
  43. Zena M. Ariola, Jan Willem Klop
    Lambda Calculus with Explicit Recursion. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:139, n:2, pp:154-233 [Journal]
  44. Hendrik Pieter Barendregt, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep
    Needed Reduction and Spine Strategies for the Lambda Calculus [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:75, n:3, pp:191-231 [Journal]
  45. Jan A. Bergstra, Jan Willem Klop
    Process Algebra for Synchronous Communication [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:60, n:1-3, pp:109-137 [Journal]
  46. Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
    Descendants and Origins in Term Rewriting. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:159, n:1-2, pp:59-124 [Journal]
  47. Marc Bezem, Jan Willem Klop, Vincent van Oostrom
    Diagram Techniques for Confluence. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:141, n:2, pp:172-204 [Journal]
  48. Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
    Transfinite Reductions in Orthogonal Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:119, n:1, pp:18-38 [Journal]
  49. Jan Willem Klop, Roel C. de Vrijer
    Unique Normal Forms for Lambda Calculus with Surjective Pairing [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:80, n:2, pp:97-113 [Journal]
  50. Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel C. de Vrijer
    Modularity of Confluence: A Simplified Proof. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:2, pp:101-109 [Journal]
  51. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:3, pp:653-682 [Journal]
  52. Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt
    Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:6, pp:1275-1304 [Journal]
  53. Jan A. Bergstra, Jan Willem Klop
    Conditional Rewrite Rules: Confluence and Termination. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:3, pp:323-362 [Journal]
  54. Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
    Comparing Curried and Uncurried Rewriting. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1996, v:21, n:1, pp:15-39 [Journal]
  55. Jan Willem Klop, Aart Middeldorp
    Sequentiality in Orthogonal Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:2, pp:161-196 [Journal]
  56. Henk Barendregt, Jan A. Bergstra, Jan Willem Klop, Henri Volken
    Degrees of Sensible Lambda Theories. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:1, pp:45-55 [Journal]
  57. Fairouz Kamareddine, Jan Willem Klop
    Editorial. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2000, v:10, n:3, pp:321-322 [Journal]
  58. Jan Willem Klop, Vincent van Oostrom, Roel C. de Vrijer
    A geometric proof of confluence by decreasing diagrams. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2000, v:10, n:3, pp:437-460 [Journal]
  59. Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
    Extending partial combinatory algebras. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1999, v:9, n:4, pp:483-505 [Journal]
  60. Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog
    Readies and Failures in the Algebra of Communicating Processes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1134-1177 [Journal]
  61. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
    On the Consistency of Koomen's Fair Abstraction Rule. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:129-176 [Journal]
  62. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland
    Term-Rewriting Systems with Rule Priorities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:2&3, pp:283-301 [Journal]
  63. J. W. de Bakker, Jan A. Bergstra, Jan Willem Klop, John-Jules Ch. Meyer
    Linear Time and Branching Time Semantics for Recursion with Merge. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:34, n:, pp:135-156 [Journal]
  64. Jan A. Bergstra, Jan Willem Klop
    Church-Rosser Strategies in the Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:9, n:, pp:27-38 [Journal]
  65. Jan A. Bergstra, Jan Willem Klop
    Invertible Terms in the Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:19-37 [Journal]
  66. Jan A. Bergstra, Jan Willem Klop
    Proving Program Inclusion Using Hoare's Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:30, n:, pp:1-48 [Journal]
  67. Jan A. Bergstra, Jan Willem Klop
    Algebra of Communicating Processes with Abstraction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:37, n:, pp:77-121 [Journal]
  68. Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
    Infinitary Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:175, n:1, pp:93-125 [Journal]
  69. Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk
    Combinatory Reduction Systems: Introduction and Survey. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:121, n:1&2, pp:279-308 [Journal]
  70. Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
    On the Adequacy of Graph Rewriting for Simulating Term Rewriting. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1994, v:16, n:3, pp:493-523 [Journal]
  71. Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk
    Reduction Strategies and Acyclicity. [Citation Graph (0, 0)][DBLP]
    Rewriting, Computation and Proof, 2007, pp:89-112 [Conf]
  72. Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop
    Productivity of Stream Definitions. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:274-287 [Conf]

  73. Modular Construction of Fixed Point Combinators and Clocked Bohm Trees. [Citation Graph (, )][DBLP]


  74. Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. [Citation Graph (, )][DBLP]


  75. Proving Infinitary Normalization. [Citation Graph (, )][DBLP]


  76. Let's Make a Difference! [Citation Graph (, )][DBLP]


  77. Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting [Citation Graph (, )][DBLP]


  78. Modular Construction of Fixed Point Combinators and Clocked Boehm Trees [Citation Graph (, )][DBLP]


Search in 0.085secs, Finished in 0.091secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002