HAL : hal-00586459, version 2

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

Versions disponibles :

v1 (16-04-2011)

v2 (25-05-2012)

Proofs as Executions

Emmanuel Beffara 1, Virgile Mogbil 2

(04/05/2012)

This paper proposes a new interpretation of the logical contents of programs in the context of concurrent interaction, wherein proofs correspond to valid executions of a processes. A type system based on linear logic is used, in which a given process has many different types, each typing corresponding to a particular way of interacting with its environment and cut elimination corresponds to executing the process in a given interaction scenario. A completeness result is established, stating that every lock-avoiding execution of process in some environment corresponds to a particular typing. Besides traces, types contain precise information about the flow of control between a process and its environment, and proofs are interpreted as composable schedulings of processes. In this interpretation, logic appears as a way of making explicit the flow of causality between interacting processes.

1 :	Institut de mathématiques de Luminy (IML)
	CNRS : UMR6206 – Université de la Méditerranée - Aix-Marseille II
2 :	Laboratoire d'informatique de Paris-nord (LIPN)
	CNRS : UMR7030 – Université Paris XIII - Paris Nord

Domaine

:

Informatique/Logique en informatique

Mots Clés : CCS – Process determinisation – Deadlock-free execution – Linear logic – Proof nets – Cut-elimination as execution

hal-00586459, version 2

http://hal.archives-ouvertes.fr/hal-00586459

oai:hal.archives-ouvertes.fr:hal-00586459

Contributeur : Virgile Mogbil <>

Soumis le : Vendredi 25 Mai 2012, 12:50:32

Dernière modification le : Vendredi 25 Mai 2012, 12:57:11