Vendredi 2 Février
Heure: 
11:00  12:30 
Lieu: 
Salle B107, bâtiment B, Université de Villetaneuse 
Résumé: 
Probabilistic Rewriting 
Description: 
Claudia Faggian We investigate how techniques from Rewrite Theory can help us to study calculi whose evaluation is both probabilistic and nondeterministic (think untyped probabilistic lambdacalculus, in which nondeterminism arises from choosing between different redexes). We are interested in relations between week and strong normalization, and whatever the result is unique. In particular, we characterize the properties nondeterminism is irrelevant and strategy A is always better than strategy B.
As an application, it turns out that probabilistic lambdacalculus equipped with weak callbyvalue reduction has striking properties. 

