Abstract
The concurrent constraint programming paradigm and linear logic are studied. The characterization of the success stores or the constraints of terminal configurations with no suspended agent, requires restricting the deductions that can be carried-out to forbid logical deletions of agents by weakening. Linear constraint systems greatly enhance the expressive power of concurrent constraint programming.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming |
| Pages | 44 |
| Number of pages | 1 |
| Publication status | Published - 1 Dec 2000 |
| Externally published | Yes |
| Event | Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'00) - Montreal, Que., Canada Duration: 20 Sept 2000 → 23 Sept 2000 |
Publication series
| Name | Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming |
|---|
Conference
| Conference | Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'00) |
|---|---|
| Country/Territory | Canada |
| City | Montreal, Que. |
| Period | 20/09/00 → 23/09/00 |