Article thumbnail
Location of Repository

Proofs as Executions

By Emmanuel Beffara and Virgile Mogbil

Abstract

International audienceThis 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

Topics: CCS, Process determinisation, Deadlock-free execution, Linear logic, Proof nets, Cut-elimination as execution, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Publisher: 'Springer Science and Business Media LLC'
Year: 2012
DOI identifier: 10.1007/978-3-642-33475-7_20
OAI identifier: oai:HAL:hal-00586459v2
Provided by: HAL AMU
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.