Остановите войну!
for scientists:
default search action
Jan Willem Klop
- > Home > Persons > Jan Willem Klop
Publications
- 2013
- [j44]Jan A. Bergstra, Jan Willem Klop, Jan Rutten:
Obituary for Jaco de Bakker, 1939-2012. Bull. EATCS 109: 14-16 (2013) - 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) - 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) - 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) - [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 - 1980
- [j3]Jan A. Bergstra, Jan Willem Klop:
Invertible Terms in the Lambda Calculus. Theor. Comput. Sci. 11: 19-37 (1980) - 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)
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 2023-10-01 22:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint