Volume 366; Issue 1-2

Theoretical Computer Science

Volume 366; Issue 1-2
1

Bisimilarity is not finitely based over BPA with interrupt

Luca Aceto, Wan Fokkink, Anna Ingolfsdottir, Sumit Nain
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 326 KB
english, 2006
2

A basic algebra of stateless connectors

Roberto Bruni, Ivan Lanese, Ugo Montanari
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 419 KB
english, 2006
3

A coalgebraic approach to the semantics of the ambient calculus

Daniel Hausmann, Till Mossakowski, Lutz Schröder
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 487 KB
english, 2006
4

Complete symbolic reachability analysis using back-and-forth narrowing

Prasanna Thati, José Meseguer
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 307 KB
english, 2006
5

Editorial board v-ix

Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 117 KB
english, 2006
6

Preface

José Fiadeiro, Jan Rutten
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 107 KB
english, 2006
7

The category-theoretic solution of recursive program schemes

Stefan Milius, Lawrence S. Moss
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 709 KB
english, 2006
8

The intersection of algebra and coalgebra

J. Adámek
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 255 KB
english, 2006
9

Discrete Lawvere theories and computational effects

Martin Hyland, John Power
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 299 KB
english, 2006