Theoretical Informatics and Applications

Informatique théorique et applications

ITA, Vol. 33, N^o 4/5, 1999

p309: Monotone (co)inductive types and positive fixed-point types
R. Matthes
Abstract | PDF file (334 Kb)
p329: The $\mu$ -calculus alternation-depth hierarchy is strict on binary trees
A. Arnold
Abstract | PDF file (151 Kb)
p341: Fixpoint alternation: Arithmetic, transition systems, and the binary tree
J.C. Bradfield
Abstract | PDF file (188 Kb)
p357: Topologies, continuity and bisimulations
J.M. Davoren
Abstract | PDF file (357 Kb)
p383: A note on negative tagging for least fixed-point formulae
D. Gurov and B. Kapron
Abstract | PDF file (151 Kb)
p393: A note on coinduction and weak bisimilarity for while programs
J.J.M.M. Rutten
Abstract | PDF file (207 Kb)
p401: Final dialgebras: From categories to allegories
R. Backhouse and P. Hoogendijk
Abstract | PDF file (213 Kb)
p427: On distributive fixed-point expressions
H. Seidl and D. Niwinski
Abstract | PDF file (217 Kb)
p447: A finite axiomatization of nondeterministic regular expressions
F. Corradini, R. De Nicola and A. Labella
Abstract | PDF file (199 Kb)
p467: Rewriting on cyclic structures: Equivalence between the operational and the categorical description
A. Corradini and F. Gadducci
Abstract | PDF file (308 Kb)