Titlebook: CAAP ‘90; 15th Colloquium on T A. Arnold Conference proceedings 1990 Springer-Verlag Berlin Heidelberg 1990 algebra.algorithm.algorithms.co

Deduct

Coherence of subsumption,e terms of an auxiliary type system, in which the terms carry a complete information about their typing proof. This technique gives also a simple proof of the existence of a minimum type for each term. From an analysis of the proofs in normal form we obtain a deterministic type-checking algorithm, which is sound and complete by construction.

認(rèn)為

Probabilistic analysis of some distributed algorithms,et [7] with different tools. We provide here an analysis of the general case with new limiting distributions. At our knowledge such kind of analysis has never been done before for the banker algorithm.

同音

On the power of bounded concurrency II: The pushdown automata level,of states that cooperate in accepting the input. In this paper we deal with the level of pushdown automata. We are interested in differencies in power of expression and in discrepencies in succinctness between variants of pda‘s that incorporate nondeterminism, pure parallelism and bounded cooperativ

PLAYS

flamboyant

Graphical versus logical specifications,ransition systems — here called graphical specifications — and Hennessy-Milner Logic. We show that any graphical specification may be expressed by a logical specification having the same models. Conversely, we give a characterization of the formulae that are graphically representable.

有說(shuō)服力

Dedication

stroke

Coherence of subsumption,ses: different typing proofs of the same term must have related meanings. We propose a proof-theoretical, rewriting approach to this problem. We focus on F≤, a second order lambda calculus with bounded quantification, which is rich enough to make the problem interesting. We define a normalizing rewr