Filters








186 Hits in 1.5 sec

Subexponential concurrent constraint programming

Carlos Olarte, Elaine Pimentel, Vivek Nigam
2015 Theoretical Computer Science  
In previous works we have shown that linear logic with subexponentials (SELL), a refinement of linear logic, can be used to specify emergent features of concurrent constraint programming (CCP) languages  ...  In order to do so, we introduced a number of extensions to SELL, such as subexponential quantifiers for the specification of modalities, and more elaborated subexponential structures for the specification  ...  We believe that linear logic together with the strong levels of adequacy may help us develop more general techniques for verifying CCP programs.  ... 
doi:10.1016/j.tcs.2015.06.031 fatcat:otxe47mfjnf75i4nov2yn7ifya

A Proof Theoretic Study of Soft Concurrent Constraint Programming

ELAINE PIMENTEL, CARLOS OLARTE, VIVEK NIGAM
2014 Theory and Practice of Logic Programming  
AbstractConcurrent Constraint Programming (CCP) is a simple and powerful model for concurrency where agents interact by telling and asking constraints.  ...  In this work, we give a proof theoretical meaning to soft constraints: they can be defined as formulas in a suitable fragment of ILL with subexponentials (SELL) where subexponentials, ordered in a c-semiring  ...  Concurrent Constraint Programming Concurrent Constraint Programming (CCP) (Saraswat et al. 1991 ) (see a survey in )) is a model for concurrency that combines the traditional operational view of process  ... 
doi:10.1017/s147106841400026x fatcat:z5cdsnb3hbd6jmmjqzrfhyneai

Dynamic Spaces in Concurrent Constraint Programming

Carlos Olarte, Vivek Nigam, Elaine Pimentel
2014 Electronical Notes in Theoretical Computer Science  
Concurrent constraint programming (CCP) is a declarative model for concurrency where agents interact with each other by posting and asking constraints (formulas in logic) in a shared store of partial information  ...  Recently, we have shown that local stores can be neatly represented in CCP by considering a constraint system where constraints are built from a fragment of linear logic with subexponentials (SELL ).  ...  Later, Fages et al. in [6] proposed Linear Concurrent Constraint Programming (lcc), inspired on linear logic [8] and linear logic programming [11] , allowing the use of linear constraints, that is  ... 
doi:10.1016/j.entcs.2014.06.008 fatcat:wuok733tqzfrlk3ptymgyyqppy

Page 6674 of Mathematical Reviews Vol. , Issue 94k [page]

1994 Mathematical Reviews  
Summary: “In concurrent constraint programming, divergence (i.e. an infinite computation) and failure are often identified.  ...  {For the entire collection see MR 94h:68006.} 94k:68020 68N15 68N17 68Q55 Kwiatkowska, Marta (4-LSTR-CS; Leicester) Infinite behaviour and fairness in concurrent constraint programming.  ... 

Proving Concurrent Constraint Programming Correct, Revisited

Carlos Olarte, Elaine Pimentel
2015 Electronical Notes in Theoretical Computer Science  
Concurrent Constraint Programming (CCP) is a simple and powerful model of concurrency where processes interact by telling and asking constraints into a global store of partial information.  ...  Nevertheless, the logical characterization of CCP programs exhibits normally a weak level of adequacy since proofs in the logical system may not correspond directly to traces of the program.  ...  Concurrent Constraint Programming (CCP) [22, 21] is a simple and powerful model of concurrency where agents interact by telling constraints (i.e., formulas in logic) into a shared store of partial information  ... 
doi:10.1016/j.entcs.2015.04.011 fatcat:gqaug2hesnhndnhe6zawimv2xa

(Mathematical) Logic for Systems Biology (Invited Paper) [chapter]

Joëlle Despeyroux
2016 Lecture Notes in Computer Science  
LL has been successfully used to model such diverse systems as: the π-calculus, concurrent ML, security protocols, multiset rewriting, and games.  ...  The identity world ι is -initial and is intended to represent the lack of any constraints.  ... 
doi:10.1007/978-3-319-45177-0_1 fatcat:imfgsz4r4jdfdi5et7jkrw7gwy

Verification of Spatial and Temporal Modalities in Biochemical Systems

Davide Chiarugi, Moreno Falaschi, Diana Hermith, Carlos Olarte
2015 Electronical Notes in Theoretical Computer Science  
The subexponential signature allows us to capture the spatial relations among the different components of the system and the timed constraints for reactions to occur.  ...  For that, we use as specification language a fragment of intuitionistic linear logic with subexponentials (SELL).  ...  Our approach for specifying and studying biological systems grounds on Concurrent Constraint Programming (CCP) [50] and on linear logic (LL) [30] .  ... 
doi:10.1016/j.entcs.2015.06.009 fatcat:ksphyjbd5fbqheyjhhoiyoy72a

Foundations for Reliable and Flexible Interactive Multimedia Scores [chapter]

Jaime Arias, Myriam Desainte-Catherine, Carlos Olarte, Camilo Rueda
2015 Lecture Notes in Computer Science  
In this paper we introduce ReactiveIS, a programming language that fully captures the temporal structure of IS during both composition and execution.  ...  On the other side, our logical characterization of ReactiveIS is based on the ideas in [10] where subexponentials in linear logic were used to give logical semantics to concurrent programming languages  ...  In [8] a semantics for Orc, a language to specify programs to orchestrate the invocation of sites that are subject to constraints on their execution, is presented.  ... 
doi:10.1007/978-3-319-20603-5_3 fatcat:6ho2qjwuurfdvd7ncyrdukk64q

Algorithmic specifications in linear logic with subexponentials

Vivek Nigam, Dale Miller
2009 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming - PPDP '09  
We shall call these additional operators subexponentials and use them to assign locations to multisets of formulas within a linear logic programming setting.  ...  Treating locations as subexponentials greatly increases the algorithmic expressiveness of logic.  ...  One might consider specifying more general algorithms such as concurrent algorithms.  ... 
doi:10.1145/1599410.1599427 dblp:conf/ppdp/NigamM09 fatcat:2xzv7s5wlzh4polnubupd6divq

An Adequate Compositional Encoding of Bigraph Structure in Linear Logic with Subexponentials [chapter]

Kaustuv Chaudhuri, Giselle Reis
2015 Lecture Notes in Computer Science  
This flexibility increases its expressiveness: we already have adequate encodings of a number of other proof systems, and for computational models such as concurrent constraint programming, in linear logic  ...  with subexponentials (SEL).  ...  By choosing the appropriate signature it is possible to encode many proof systems [14] and various models of concurrency in concurrent constraint programming [13] in a natural way.  ... 
doi:10.1007/978-3-662-48899-7_11 fatcat:g2twkmcfrjdmbkjdi7s3ri27by

A subexponential view of domains in session types [article]

Daniele Nantes and Carlos Olarte and Daniel Ventura
2021 arXiv   pre-print
The subexponentials in LL have also played an important role in concurrent systems since they can be interpreted in different ways, including timed, spatial and even epistemic modalities in distributed  ...  Since its inception, several connections between concurrent systems and LL have emerged from different perspectives.  ...  Session types is a formalism to reason about processes, providing a typing discipline for concurrent programming based on process algebras such as the π-calculus [THK94, HVK98] .  ... 
arXiv:2110.03964v1 fatcat:njdkovv27ne35juvyqgrylm37q

Subexponentials in non-commutative linear logic [article]

Max Kanovich, Stepan Kuznetsov, Vivek Nigam, Andre Scedrov
2017 arXiv   pre-print
Linear logical frameworks with subexponentials have been used for the specification of among other systems, proof systems, concurrent programming languages and linear authorization logics.  ...  These systems can disallow the application of exchange rule on some subexponentials.  ...  In the recent years, it has been shown that SELL can also be used to specify linear authorization logics [Nigam, 2012 [Nigam, , 2014 , concurrent constraint programming languages [Nigam et al., 2013  ... 
arXiv:1709.03607v1 fatcat:ft5zuquzsza25a3csdz6hxxqhe

A proof theoretic view of spatial and temporal dependencies in biochemical systems

C. Olarte, D. Chiarugi, M. Falaschi, D. Hermith
2016 Theoretical Computer Science  
The subexponential signature allows us to capture the spatial relations among the different components of the system and the timed constraints.  ...  To this aim, we consider a fragment of intuitionistic linear logic with subexponentials (SELL).  ...  In [32] , we proposed a tailored Concurrent Constraint Programming-based [35] formalism for dealing with spatial modalities.  ... 
doi:10.1016/j.tcs.2016.03.029 fatcat:t3t2p7qy5fgunda44sog6slufi

On the Relation of Interaction Semantics to Continuations and Defunctionalization

Ulrich Schöpp, Masahito Hasegawa
2014 Logical Methods in Computer Science  
In game semantics and related approaches to programming language semantics, programs are modelled by interaction dialogues.  ...  Such models have recently been used in the design of new compilation methods, e.g. for hardware synthesis or for programming with sublinear space.  ...  The constraints all have the form A α, i.e. the right-hand side of any constraint is a type variable.  ... 
doi:10.2168/lmcs-10(4:10)2014 fatcat:2zwhwjsdcba6zcew6nzoq3b2eq

On Interaction, Continuations and Defunctionalization [chapter]

Ulrich Schöpp
2013 Lecture Notes in Computer Science  
In game semantics and related approaches to programming language semantics, programs are modelled by interaction dialogues.  ...  Such models have recently been used in the design of new compilation methods, e.g. in Ghica's approach to hardware synthesis, or in joint work with Dal Lago on programming with sublinear space.  ...  The type system is also quite similar to the type system for Syntactic Control of Concurrency (SCC) in [8] .  ... 
doi:10.1007/978-3-642-38946-7_16 fatcat:gmw42uj4onh3xnckrwlnyf4h5q
« Previous Showing results 1 — 15 out of 186 results