Concurrent constraint programming and non-commutative logic Export

@incollection{citeulike:5724270, abstract = {This paper presents a connection between the intuitionistic fragment of a non-commutative version of linear logic introduced by the first author (NLI) and concurrent constraint programming (CC). We refine existing logical characterizations of operational aspects of CC, by providing a logical interpretation of finer observable properties of CC programs, namely stores, successes and suspensions.}, author = {Ruet, Paul and Fages, Fran\c{c}ois}, citeulike-article-id = {5724270}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/BFb0028028}, citeulike-linkout-1 = {http://www.springerlink.com/content/d436p1422vv74133}, doi = {10.1007/BFb0028028}, journal = {Computer Science Logic}, keywords = {categorial-logic, concurrent-constraint-programming, linear-logic}, pages = {406--423}, posted-at = {2009-09-04 18:24:02}, priority = {3}, title = {Concurrent constraint programming and non-commutative logic}, url = {http://dx.doi.org/10.1007/BFb0028028}, year = {1998} }

TY - CHAP ID - citeulike:5724270 L3 - citeulike-article-id:5724270 N2 - This paper presents a connection between the intuitionistic fragment of a non-commutative version of linear logic introduced by the first author (NLI) and concurrent constraint programming (CC). We refine existing logical characterizations of operational aspects of CC, by providing a logical interpretation of finer observable properties of CC programs, namely stores, successes and suspensions. JF - Computer Science Logic EP - 423 TI - Concurrent constraint programming and non-commutative logic SP - 406 KW - categorial-logic KW - concurrent-constraint-programming KW - linear-logic AU - Ruet, Paul AU - Fages, François PY - 1998/// UR - http://dx.doi.org/10.1007/BFb0028028 ER -