On subexponentials, focusing and modalities in concurrent systems

In this work we present the focused proof system SELLF⋒, which extends intuitionistic linear logic with subexponentials with the ability of quantifying over them, hence allowing for the use of an arbitrary number of modalities. We show that the view of subexponentials as specific modalities is gener...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 693; S. 35 - 58
Hauptverfasser: Nigam, Vivek, Olarte, Carlos, Pimentel, Elaine
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 12.09.2017
Schlagworte:
Concurrent constraint programming
Linear logic
Proof systems
Concurrent constraint programming
Linear logic
Proof systems
ISSN:0304-3975, 1879-2294
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this work we present the focused proof system SELLF⋒, which extends intuitionistic linear logic with subexponentials with the ability of quantifying over them, hence allowing for the use of an arbitrary number of modalities. We show that the view of subexponentials as specific modalities is general enough to give a modular encoding of different flavors of Concurrent Constraint Programming (CCP), a simple and powerful model of concurrency. More precisely, we encode CCP calculi capturing time, spatial and epistemic behaviors into SELLF⋒, thus providing a proof theoretic foundation for those calculi and, at the same time, setting SELLF⋒ as a general framework for specifying such systems.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2017.06.009