Process-As-Formula Interpretation: A Substructural Multimodal View (Invited Talk)

In this survey, we show how the processes-as-formulas interpretation, where computations and proof-search are strongly connected, can be used to specify different concurrent behaviors as logical theories. The proposed interpretation is parametric and modular, and it faithfully captures behaviors such as: Linear and spatial computations, epistemic state of agents, and preferences in concurrent systems. The key for this modularity is the incorporation of multimodalities in a resource aware logic, together with the ability of quantifying on such modalities. We achieve tight adequacy theorems by relying on a focusing discipline that allows for controlling the proof search process. 2012 ACM Subject Classification Theory of computation → Proof theory; Theory of computation → Process calculi

[1]  Ehud Shapiro,et al.  The family of concurrent logic programming languages , 1989, CSUR.

[2]  Elaine Pimentel,et al.  Hybrid linear logic, revisited , 2019, Math. Struct. Comput. Sci..

[3]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

[4]  Elaine Pimentel,et al.  A uniform framework for substructural logics with modalities , 2017, LPAR.

[5]  Carlos Olarte,et al.  A proof theoretic view of spatial and temporal dependencies in biochemical systems , 2016, Theor. Comput. Sci..

[6]  Maurizio Gabbrielli,et al.  Proving correctness of timed concurrent constraint programs , 2002, TOCL.

[7]  Elaine Pimentel,et al.  On concurrent behaviors and focusing in linear logic , 2017, Theor. Comput. Sci..

[8]  Dale Miller,et al.  A Framework for Proof Systems , 2010, Journal of Automated Reasoning.

[9]  Vivek Nigam.  On the Complexity of Linear Authorization Logics , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[10]  Catuscia Palamidessi,et al.  Encoding Transition Systems in Sequent Calculus , 2003, Linear Logic Tokyo Meeting.

[11]  Elaine Pimentel,et al.  Modularisation of Sequent Calculi for Normal and Non-normal Modalities , 2017, ACM Trans. Comput. Log..

[12]  Dale Miller,et al.  Algorithmic specifications in linear logic with subexponentials , 2009, PPDP '09.

[13]  ROBIN MILNER,et al.  Edinburgh Research Explorer A Calculus of Mobile Processes, I , 2003 .

[14]  François Fages,et al.  Linear Concurrent Constraint Programming: Operational and Phase Semantics , 2001, Inf. Comput..

[15]  Kaustuv Chaudhuri,et al.  An Adequate Compositional Encoding of Bigraph Structure in Linear Logic with Subexponentials , 2015, LPAR.

[16]  Prakash Panangaden,et al.  The semantic foundations of concurrent constraint programming , 1991, POPL '91.

[17]  Fabio Gadducci,et al.  Observational and behavioural equivalences for soft concurrent constraint programming , 2017, J. Log. Algebraic Methods Program..

[18]  Elaine Pimentel,et al.  A General Proof System for Modalities in Concurrent Constraint Programming , 2013, CONCUR.

[19]  Vincent Danos,et al.  The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs , 1993, Kurt Gödel Colloquium.

[20]  Camilo Rueda,et al.  Models and emerging trends of concurrent constraint programming , 2013, Constraints.

[21]  Elaine Pimentel,et al.  On subexponentials, focusing and modalities in concurrent systems , 2017, Theor. Comput. Sci..

[22]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[23]  Dale Miller,et al.  Focusing and Polarization in Intuitionistic Logic , 2007, CSL.

[24]  Tiziano Dalmonte,et al.  Hypersequent calculi for non-normal modal and deontic logics: Countermodels and optimal complexity , 2020, J. Log. Comput..

[25]  Elaine Pimentel,et al.  An extended framework for specifying and reasoning about proof systems , 2016, J. Log. Comput..

[26]  Gert Smolka.  A Foundation for Higher-order Concurrent Constraint Programming , 1994, CCL.

[27]  Frank D. Valencia,et al.  Temporal Concurrent Constraint Programming: Denotation, Logic and Applications , 2002, Nord. J. Comput..

[28]  Elaine Pimentel,et al.  Multi-focused Proofs with Different Polarity Assignments , 2015, LSFA.

[29]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[30]  Kaustuv Chaudhuri.  Classical and Intuitionistic Subexponential Logics Are Equally Expressive , 2010, CSL.

[31]  Camilo Rueda,et al.  A Concurrent Constraint Programming Interpretation of Access Permissions , 2018, Theory Pract. Log. Program..

[32]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[33]  Elaine Pimentel,et al.  A Proof Theoretic Study of Soft Concurrent Constraint Programming , 2014, Theory Pract. Log. Program..

[34]  YUXIN DENG,et al.  Relating reasoning methodologies in linear logic and process algebra , 2012, Mathematical Structures in Computer Science.

[35]  Frank D. Valencia,et al.  Spatial and Epistemic Modalities in Constraint-Based Process Calculi , 2012, CONCUR.

[36]  Dale Miller.  The pi-Calculus as a Theory in Linear Logic: Preliminary Results , 1992, ELP.

[37]  Elaine Pimentel,et al.  Subexponential concurrent constraint programming , 2015, Theor. Comput. Sci..

[38]  David Baelde,et al.  Least and Greatest Fixed Points in Linear Logic , 2007, TOCL.