Tome 45 (2011) no. 1

Sommaire

ICTCS 09 Foreword
p. 1-2
Idealized coinductive type systems for imperative object-oriented programs
p. 3-33
Enumerated type semantics for the calculus of looping sequences
p. 35-58
Hopcroft's algorithm and tree-like automata
p. 59-75
Consensual languages and matching finite-state computations
p. 77-97
An introduction to quantum annealing
p. 99-116
The compositional construction of Markov processes II
p. 117-142
Extending the lambda-calculus with unbind and rebind
p. 143-162
Strategies to scan pictures with automata based on Wang tiles
p. 163-180