RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 4-5

Sommaire

Preface

ITA

p. 9

Monotone (co)inductive types and positive fixed-point types

Matthes, Ralph

p. 309-328

The

μ

-calculus alternation-depth hierarchy is strict on binary trees

Arnold, André

p. 329-339

Fixpoint alternation : arithmetic, transition systems, and the binary tree

Bradfield, J. C.

p. 341-356

Topologies, continuity and bisimulations

Davoren, J. M.

p. 357-381

A note on negative tagging for least fixed-point formulae

Gurov, Dilian ; Kapron, Bruce

p. 383-392

A note on coinduction and weak bisimilarity for while programs

Rutten, J. J. M. M.

p. 393-400

Final dialgebras : from categories to allegories

Backhouse, Roland ; Hoogendijk, Paul

p. 401-426

On distributive fixed-point expressions

Seidl, Helmut ; NiwiŃski, Damian

p. 427-446

A finite axiomatization of nondeterministic regular expressions

Corradini, Flavio ; De Nicola, Rocco ; Labella, Anna

p. 447-465

Rewriting on cyclic structures : equivalence between the operational and the categorical description

Corradini, Andrea ; Gadducci, Fabio

p. 467-493