Exposé de Jean-Yves Marion, Université de Lorraine, LORIA

Abstract : Dynamic data-structures are ubiquitous in programming, and they use extensively underlying directed multi-graph structures, such as labeled trees, DAGs, and objects. We will discuss about program information flow, energy and Computational Complexity.