Jan Willem Klop
#21,326
Most Influential Person Now
Dutch computer scientist
Jan Willem Klop's AcademicInfluence.com Rankings
Jan Willem Klopcomputer-science Degrees
Computer Science
#1507
World Rank
#1561
Historical Rank
Theoretical Computer Science
#43
World Rank
#43
Historical Rank
Database
#3736
World Rank
#3889
Historical Rank
Download Badge
Computer Science
Jan Willem Klop's Degrees
- PhD Mathematics University of Amsterdam
Why Is Jan Willem Klop Influential?
(Suggest an Edit or Addition)According to Wikipedia, Jan Willem Klop is a professor of applied logic at Vrije Universiteit in Amsterdam. He holds a Ph.D. in mathematical logic from Utrecht University. Klop is known for his work on the algebra of communicating processes, co-author of TeReSe and his fixed point combinatorYk = whereL = λabcdefghijklmnopqstuvwxyzr. Klop became a member of the Royal Netherlands Academy of Arts and Sciences in 2003.
Jan Willem Klop's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Process Algebra for Synchronous Communication (1984) (1073)
- Algebra of Communicating Processes with Abstraction (1985) (790)
- Combinatory reduction systems (1980) (666)
- Combinatory Reduction Systems: Introduction and Survey (1993) (305)
- Term Graph Rewriting (1995) (247)
- Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages (1987) (215)
- Conditional Rewrite Rules: Confluence and Termination (1986) (215)
- Term Rewriting Systems (1993) (212)
- Syntax and defining equations for an interrupt mechanism in process algebra (1985) (195)
- On the Consistency of Koomen's Fair Abstraction Rule (1987) (193)
- Transfinite Reductions in Orthogonal Term Rewriting Systems (1995) (170)
- The Algebra of Recursively Defined Processes and the Algebra of Regular Processes (1984) (168)
- Equational Term Graph Rewriting (1996) (152)
- Infinitary Lambda Calculus (1997) (149)
- Decidability of bisimulation equivalence for process generating context-free languages (1993) (130)
- Term rewriting systems: a tutorial (1987) (119)
- Verification of an alternating bit protocol by means of process algebra (1985) (118)
- Algebra of Communicating Processes (1995) (110)
- An Analysis of Loop Checking Mechanisms for Logic Programs (1991) (105)
- Sequentiality in Orthogonal Term Rewriting Systems (1991) (99)
- Fixed point semantics in process algebras : (preprint) (1982) (96)
- Process theory based on bisimulation semantics (1988) (92)
- Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator (1987) (91)
- On the adequacy of graph rewriting for simulating term rewriting (1994) (89)
- Linear Time and Branching Time Semantics for Recursion with Merge (1983) (82)
- Failures without chaos: a new process semantics for fair abstraction (1987) (80)
- Needed Reduction and Spine Strategies for the Lambda Calculus (1987) (77)
- Lambda Calculus with Explicit Recursion (1997) (76)
- Readies and Failures in the Algebra of Communicating Processes (1988) (76)
- Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft- (1989) (73)
- A complete inference system for rgular processes with silent moves (1984) (67)
- Productivity of stream definitions (2007) (63)
- Cyclic lambda graph rewriting (1994) (61)
- Asynchronous communication in process algebra (1992) (60)
- Lambda calculus with patterns (2008) (60)
- Term-Rewriting Systems with Rule Priorities (1989) (59)
- CONCUR '90 Theories of Concurrency: Unification and Extension (1990) (56)
- Open Problems in Rewriting (1991) (53)
- Infinitary Normalization (2005) (49)
- Comparing Curried and Uncurried Rewriting (1993) (48)
- Descendants and Origins in Term Rewriting (2000) (46)
- Process Algebra with Asynchronous Communication Mechanisms (1984) (46)
- WST ’ 04 7 th International Workshop on Termination (2004) (46)
- Refinement in branching time semantics (1989) (45)
- Degrees, reductions and representability in the lambda calculus (1976) (45)
- What is in a step (1989) (39)
- On the Safe Termination of PROLOG Programs (1989) (39)
- Termination for direct sums of left-linear complete term rewriting systems (1995) (39)
- Unique Normal Forms for Lambda Calculus with Surjective Pairing (1989) (38)
- The adequacy of term graph rewriting for simulating term rewriting (1993) (37)
- Infinitary Lambda Calculi and Böhm Models (1995) (36)
- Conditional axioms and α/β-calculus in process algebra (1987) (35)
- Modularity of Confluence: A Simplified Proof (1994) (33)
- More Problems in Rewriting (1993) (32)
- ACP - a universal axiom system for process specification (1987) (31)
- Strong Normalization and Perpetual Reductions in the Lambda Calculus (1982) (31)
- Term Rewriting Systems with Priorities (1987) (31)
- Applications of infinitary lambda calculus (2009) (30)
- Trans nite Reductions in Orthogonal Term Rewriting (1995) (30)
- A convergence theorem in process algebra (1982) (29)
- Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond (1990) (29)
- Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract) (1991) (27)
- Highlights in infinitary rewriting and lambda calculus (2012) (23)
- On equal μ-terms (2011) (22)
- The process of De Bakker and Zucker represent bisimulation equivalence classes (1989) (22)
- Degrees of Streams (2011) (22)
- Bisimilarity in Term Graph Rewriting (2000) (22)
- ACTtau: A Universal Axiom System for Process Specification (1989) (21)
- Correctness of Programs with Function Procedures (1981) (21)
- Proving Program Inclusion Using Hoare's Logic (1984) (20)
- Diagram Techniques for Confluence (1996) (20)
- Proving Infinitary Normalization (2009) (20)
- Problems in Rewriting III (1995) (19)
- Process algebra for communication and mutual exclusion (1983) (19)
- Failure semantics with fair abstraction (1986) (18)
- Extended Term Rewriting Systems (1990) (18)
- Church-Rosser Strategies in the Lambda Calculus (1979) (17)
- Syntactic Definitions of Undefined: On Defining the Undefined (1994) (17)
- An abstraction mechanism for process algebras (1983) (16)
- Event structures and orthogonal term graph rewriting (1993) (16)
- Algebraic Tools for System Construction (1983) (14)
- Invertible Terms in the Lambda Calculus (1980) (14)
- Automatic Sequences and Zip-Specifications (2012) (14)
- Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting (2010) (14)
- A geometric proof of confluence by decreasing diagrams (2000) (13)
- Iterative Lexicographic Path Orders (2006) (13)
- A process algebra for the operational semantics of static data flow networks (1983) (12)
- Degrees of Transducibility (2015) (12)
- Collapsing Partial Combinatory Algebras (1995) (12)
- Confluent rewriting of bisimilar term graphs (1997) (12)
- Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras (1982) (11)
- Modular Construction of Fixed Point Combinators and Clocked Böhm Trees (2010) (11)
- Degrees of Infinite Words, Polynomials and Atoms (2016) (11)
- Discriminating Lambda-Terms Using Clocked Boehm Trees (2012) (11)
- An infinitary Church-Rosser property for non-collapsing orthogonal term rewriting systems (1993) (11)
- Representability in lambda algebras (1976) (10)
- An operational semantics for process algebra (1985) (10)
- Vicious Circles in Orthogonal Term Rewriting Systems (2005) (10)
- First-order term rewriting systems (2003) (9)
- Completing partial combinatory algebras with unique head-normal forms (1996) (9)
- Initial Algebra Specifications for Parametrized Data Types (1981) (9)
- Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems (2018) (8)
- Failures without chaos : a new process model for fair abstraction (1987) (8)
- Four equivalent equivalences of reductions (2002) (8)
- Reduction Strategies and Acyclicity (2007) (8)
- On the Power of Subsumption and Context Checks (1990) (7)
- A proof rule for restoring logic circuits (1983) (7)
- Dance of the Starlings (2017) (7)
- Priority rewrite systems (1984) (7)
- De Bruijn’s weak diamond property revisited (2013) (7)
- An introduction to process algebra (1992) (7)
- Extending partial combinatory algebras (1999) (7)
- A simplified proof of Toyama's theorem (1991) (7)
- Transducer degrees: atoms, infima and suprema (2019) (6)
- Degrees of sensible lambda theories (1978) (6)
- Vicious circles in rewriting systems (2004) (6)
- Algebra of communicating processes : part II (1984) (6)
- Streams are Forever (2013) (5)
- Innnitary Lambda Calculus (1996) (5)
- The practical importance of formal semantics (1989) (5)
- A formalized proof system for total correctness of while programs (1982) (4)
- Examples of TRSs and special rewriting formats (2003) (4)
- Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples (2014) (4)
- Clocked lambda calculus † (2015) (4)
- Object-oriented algebraic specification proposal for a notation and $12$ examples (1984) (4)
- Decreasing Diagrams for Confluence and Commutation (2019) (4)
- An introduction to term graph rewriting (1993) (4)
- An algebraic specification method for processes over a finite action set (1983) (4)
- Fair FIFO queues satisfy an algebraic criterion for protocol correctness (1984) (3)
- Conditional axioms and alpha/beta-calculus in process algebra (1985) (3)
- Let's Make a Difference! (2009) (3)
- Diagram Techniques for Connuence (1996) (3)
- Towards compositional predicate transformer semantics for concurrent programs (1989) (3)
- Lambda-calculus, types and models (1998) (3)
- On solvability by lambda I - terms (1975) (2)
- In nitary lambda calculus (1995) (2)
- Diagram Techniques for Con uence (2008) (2)
- A theory of programs : an outline of joint work : IBM seminar Vienna, August 1969 (1989) (2)
- Clocks for Functional Programs (2013) (2)
- Formal Proof Systems for Program Equivalence (1982) (2)
- Degrees of Infinite Words, Polynomials, and Atoms (Extended Version) (2018) (1)
- Arithmetic Self-Similarity of Infinite Sequences (2012) (1)
- A compositional semantics for the Turing machine (1989) (1)
- Lower bounds for a class of Kostka numbers (1986) (1)
- Applications of computability theory over abstract data types (1989) (1)
- Syntactic de nitions of unde ned : on de ning the unde nedEXTENDED (1994) (1)
- Abstract reduction systems (2003) (1)
- Confluence of the Chinese Monoid (2019) (1)
- Conditional rewrite rules; confluency and termination : Preprint (1982) (1)
- Braids via term rewriting (2019) (1)
- Proceedings on Theories of concurrency : unification and extension: unification and extension (1990) (1)
- Properties of rewriting: decidability and modularity (2003) (1)
- A characterization of the state spaces of elementary net systems (1989) (1)
- Combinatory reduction introduction and survey systems (1993) (1)
- Typography in process algebra (2011) (1)
- An introduction to Knuth-Bendix completion (1988) (1)
- Strongly sequential rewriting systems (1987) (0)
- Applications of In nitary Lambda Calculus (2016) (0)
- Preprint : Algebra of communicating processes (1984) (0)
- Apart 7 Conclusion (1994) (0)
- Programmacorrectheid en het college Inleiding informatica (1989) (0)
- Advanced ARS theory (2003) (0)
- Nicolaas Govert de Bruijn (1918–2012) Mathematician, computer scientist, logician (2013) (0)
- Star Games and Hydras (2020) (0)
- Introductory note to "Object-Oriented Algebra Specification" (1994) (0)
- Term Rewriting and All That by Franz Baader and Tobias Nipkow, Cambridge University Press, 1998, ISBN 0-521-45520-0 (hardback), 301pp. (2001) (0)
- Obituary for Jaco de Bakker, 1939-2012 (2013) (0)
- Formal proof systems for program equivalence : (preprint) (1982) (0)
- Origin Tracking in Term Rewriting (Abstract) (1998) (0)
- Geometry of processes (2004) (0)
- Bisimilarity in Term Graph Rewriting Bisimilarity in Term Graph Rewriting (1998) (0)
- A summary of the work on the proof theory for the language POOL (1989) (0)
- Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting (2009) (0)
- Bisimilarity in Term Graph Rewriting Bisimilarity in Term Graph Rewriting (1998) (0)
- On the use of semantics: extending Prolog to a parallel object oriented language (1989) (0)
- L.E.J. Brouwer, fifty years later (2019) (0)
- Qualitative $\lambda$-models as type assignment systems (1989) (0)
- Strong normalisation and perpetual reduction in the lambda calculus (1982) (0)
- In nitary Lambda (2007) (0)
- Correctness of programs with function procedures : (preprint) (1981) (0)
- The semantics and complexity of parallel programs for vector computations, part II (1989) (0)
- Attachment system for a plantentransportkar and method for manufacturing the same. (2014) (0)
- Metric semantics for the input/output behaviour of sequential programs (1989) (0)
- Plastic pot equipped with flow elements. (2013) (0)
- Some Remarks on Definability of Process Graphs (2006) (0)
- Explorer Pure bigraphs : Structure and dynamics (2017) (0)
- Notes on Decreasing Diagrams for Confluence and Commutation (2019) (0)
- A Survey of Abstract Rewriting 4 Termination Criteria 41 (1995) (0)
- Syntactic Degrees of Definability (2013) (0)
- The decent philosophers: an exercise in operational semantics of concurrent systems (1989) (0)
- A geometric proof of con uence by decreasing diagrams (2000) (0)
- FROM FINITE TO INFINITE LAMBDA CALCULI (1997) (0)
- Iwc 2013 2nd International Workshop on Confluence Program Committee Three Termination Problems Confluence and Infinity -a Kaleidoscopic View Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering (extended Abstract) (2013) (0)
- Iterative path orders (2004) (0)
- Con uent Rewriting of Bisimilar Term Graphs 1 (2019) (0)
- Playing at semantics (1989) (0)
- Specificatie en analyse van ingebedde systemen (SEN2) (1997) (0)
- Strongly Sequential Term Rewriting Systems (2007) (0)
- A Geometric Proof of Connuence by Decreasing Diagrams (2007) (0)
- Lambda Calculus with Explicit Recursion Lambda Calculus with Explicit Recursion (1996) (0)
- Lambda Calculus with Explicit Recursion Lambda Calculus with Explicit Recursion (1996) (0)
- On formal and informal reasoning in program construction (1989) (0)
- An Introduction to the Clocked Lambda Calculus (2014) (0)
- Abstract objects as abstract data types revisited (1989) (0)
- Reflections on a Geometry of Processes (2006) (0)
- Proceedings of the Theories of Concurrency: Unification and Extension (1990) (0)
- The free process algebra generated by δ, ϵ and τ (2011) (0)
- Specification and analysis of embedded systems (SEN2) (1997) (0)
- A note on disjoint parallelism (1989) (0)
- Computing with actions and communications (2007) (0)
- Iterative Path Orders Extended abstract (2002) (0)
- LINEAR TIME AND BRANCHING FOR RECURSION WITH MERGE TIME SEMANTICS (1984) (0)
- ALGEBRAIC TOOLS FOP . SYSTEM CONSTRUCTION (2005) (0)
- Transducer degrees: atoms, infima and suprema (2019) (0)
- Staircase to Syracuse (2004) (0)
- Term rewriting and lambda calculus (2012) (0)
This paper list is powered by the following services:
Other Resources About Jan Willem Klop
What Schools Are Affiliated With Jan Willem Klop?
Jan Willem Klop is affiliated with the following schools:
