L-Nets, Strategies and Proof-Nets

We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying an additional condition, which we call logical L-nets, can be sequentialized into traditional tree-like strategies, and vice-versa.

• Type: Conference
• Year: 2005
• Where: CSL
• Authors: Pierre-Louis Curien, Claudia Faggian
• Keywords: Concurrent Interaction, CSL 2005, Girard’s Ludics, Traditional Tree-like Strategies