|
|
 |
|
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 non-deterministic (think untyped probabilistic lambda-calculus, in which non-determinism 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 non-determinism is irrelevant and strategy A is always better than strategy B.
As an application, it turns out that probabilistic lambda-calculus equipped
with weak call-by-value reduction has striking properties. |
|
|
