کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4951978 | 1441996 | 2017 | 24 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On subexponentials, focusing and modalities in concurrent systems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On subexponentials, focusing and modalities in concurrent systems On subexponentials, focusing and modalities in concurrent systems](/preview/png/4951978.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 693, 12 September 2017, Pages 35-58
Journal: Theoretical Computer Science - Volume 693, 12 September 2017, Pages 35-58
نویسندگان
Vivek Nigam, Carlos Olarte, Elaine Pimentel,