Session-based concurrency is a type-based approach to the analysis of message-passing programs. These programs may be specified in an operational or declarative style: the former defines how interactions are properly structured; the latter defines governing conditions for correct interactions. In this paper, we study rigorous relationships between operational and declarative models of session-based concurrency. We develop a correct encoding of session \(\pi \)-calculus processes into the linear concurrent constraint calculus (\(\texttt {lcc}\)), a declarative model of concurrency based on partial information (constraints). We exploit session types to ensure that our encoding satisfies precise correctness properties and that it offers a sound basis on which operational and declarative requirements can be jointly specified and reasoned about. We demonstrate the applicability of our results by using our encoding in the specification of realistic communication patterns with time and contextual information.

基于会话的并发是一种用于分析消息传递程序的基于类型的方法。这些程序可以以操作性或声明性的方式指定：前者定义交互的正确结构；后者定义了正确交互的管理条件。在本文中，我们研究了基于会话的并发的操作模型和声明模型之间的严格关系。我们将会话\（\ pi \）-演算过程正确编码为线性并发约束演算（\（\ texttt {lcc} \）），一个基于部分信息（约束）的声明式并发模型。我们利用会话类型来确保我们的编码满足精确的正确性属性，并为联合指定和推理操作和声明性要求提供了良好的基础。我们通过在带有时间和上下文信息的现实通信模式的规范中使用我们的编码来证明我们的结果的适用性。