A confluent calculus for concurrent constraint programming
From MaRDI portal
Publication:1391935
DOI10.1016/S0304-3975(96)00196-XzbMath0902.68034MaRDI QIDQ1391935
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Cites Work
- The lambda calculus, its syntax and semantics
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Principles and practice of constraint programming. 2nd international workshop, PPCP '94, Rosario, Orcas Island, Washington, DC, USA, May 2-4, 1994. Proceedings
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Efficient analysis of concurrent constraint logic programs
- A confluent relational calculus for higher-order programming with constraints
- Confluence in concurrent constraint programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item