Klop, J.W. (Jan Willem), 1945-
Klop, J.W.
Klop, Jan Willem 1945-
Klop, Jan
Jan Willem Klop
Klop, Jan Willen
Klop, J. W. (Jan Willem)
VIAF ID: 77651947 ( Personal )
Permalink: http://viaf.org/viaf/77651947
Preferred Forms
- 100 0 _ ‡a Jan Willem Klop
- 100 1 _ ‡a Klop, J. W.
-
-
- 100 1 0 ‡a Klop, J. W.
- 100 1 _ ‡a Klop, J. W. ‡q (Jan Willem)
-
-
- 100 1 _ ‡a Klop, Jan
-
- 100 1 _ ‡a Klop, Jan Willem ‡d 1945-
-
4xx's: Alternate Name Forms (5)
5xx's: Related Names (1)
Works
Title | Sources |
---|---|
ACPt : a universal axiom system for process specification | |
The algebra of recursively defined processes and the algebra of regular processes | |
An algebraic specification method for processes over a finite action set | |
Algebraic tools for system construction | |
An analysis of loop checking mechanisms for logic programs | |
Asynchronous communication in process algebra : extended abstract | |
Combinatory reduction systems, 1980: | |
A complete inference system for regular processes with silent moves | |
CONCUR '90, c1990: | |
CONCUR '90 : theories of concurrency : unificiation and extension : Amsterdam, the Netherlands, August 27-30, 1990 : proceedings | |
Conditional axioms and α/β calculus in process algebra | |
Conditional rewrite rules : confluency and termination | |
A convergence theorem in process algebra | |
Correctness of programs with function procedures | |
Decidability of bisimulation equivalence for processes generating context-free languages | |
Descendants and origins in term rewriting | |
Diagram techniques for confluence | |
Dirk van Dalen : Festschrift | |
Equational term graph rewriting | |
Extending partial combinatory algebras | |
Failures without chaos : a new processs semantics for fair abstraction | |
Fair FIFO queues satisfy an algebraic criterion for protocol correctness | |
Fixed point semantics in process algebras | |
Formal proof systems for program equivalence | |
A geometric proof of confluence by decreasing diagrams | |
Infinitary normalization | |
Initial algebra specifications for parametrized data types | |
An introduction to Knuth-Bendix completion | |
J.W. de Bakker, 25 jaar semantiek | |
Lambda calculus with explicit recursion | |
Lower bounds for a class of Kostka numbers | |
A note on some abstract confluence criteria | |
Object-oriented algebraic specification: proposal for a notation and 12 examples | |
On the consistency of Koomen's fair abstraction rule | |
On the safe termination of PROLOG programs | |
Priority rewrite systems | |
Problems in rewriting III | |
A process algebra for the operational semantics of static data flow networks | |
Process theory based on bisimulation semantics | |
Processes, terms and cycles: steps on the road to infinity essays dedicated to Jan Willem Klop on the occasion of his 60th birthday | |
A proof rule for restoring logic circuits | |
Proving program inclusion using Hoare's logic | |
Readies and failures in the algebra of communicating processes | |
Ready trace semantiek voor procesalgebra met prioriteitsoperator | |
A simplified proof of Toyama's theorem | |
Spécification algébrique de types de données à accès concurrent | |
Syntax and defining equations for an interrupt mechanism in process algebra | |
Term rewriting systems, 2002: | |
Termherschrijfsystemen | |
Unique normal forms for Lambda calculus with surjective pairing | |
Verification of an alternating bit protocol by means of process algebra |