Concurrent constraint programming and non-commutative logic

被引:0
|
作者
Ruet, P [1 ]
Fages, F [1 ]
机构
[1] Ecole Normale Super, CNRS, LIENS, F-75005 Paris, France
来源
COMPUTER SCIENCE LOGIC | 1998年 / 1414卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper presents a connection between the intuitionistic tic 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.
引用
收藏
页码:406 / 423
页数:18
相关论文
共 50 条