Tome 33 (1999) no. 4-5

Sommaire

Preface
ITA
p. 9
Monotone (co)inductive types and positive fixed-point types
p. 309-328
The μ-calculus alternation-depth hierarchy is strict on binary trees
p. 329-339
Fixpoint alternation : arithmetic, transition systems, and the binary tree
p. 341-356
Topologies, continuity and bisimulations
p. 357-381
A note on negative tagging for least fixed-point formulae
p. 383-392
A note on coinduction and weak bisimilarity for while programs
p. 393-400
Final dialgebras : from categories to allegories
p. 401-426
On distributive fixed-point expressions
p. 427-446
A finite axiomatization of nondeterministic regular expressions
p. 447-465
Rewriting on cyclic structures : equivalence between the operational and the categorical description
p. 467-493