Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
2
1
1

Relationship

1
3

Authors

Journals

citations
Cited by 7 publications
references
References 8 publications
0
6
0
Order By: Relevance
“…Specifically, we show how to obtain adequate representations of least and greatest fixed points in Poly through the encoding of initial and final (co)algebras in the -calculus. We also straightforwardly derive a strong normalisation result for the higher-order session calculus, which otherwise involves non-trivial proof techniques [8,11,17,18,50]. Future work includes extensions to the classical linear logic-based framework, including multiparty session types [14,15].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Specifically, we show how to obtain adequate representations of least and greatest fixed points in Poly through the encoding of initial and final (co)algebras in the -calculus. We also straightforwardly derive a strong normalisation result for the higher-order session calculus, which otherwise involves non-trivial proof techniques [8,11,17,18,50]. Future work includes extensions to the classical linear logic-based framework, including multiparty session types [14,15].…”
Section: Discussionmentioning
confidence: 99%
“…Higher-order session calculi and their encodings have been studied in [35]. Termination for higher-order processes has been studied in [17,18].…”
Section: Related Workmentioning
confidence: 99%
“…A further development of this approach has been studied in [RDS09], where the rewriting-based methods are applied to study termination in versions of the π-calculus that feature constructs for higher-order communication and, more generally, for the manipulation of process terms. This should open the way in particular for the adaptation of our results to recent proposals for models of distributed programming, where forms of code mobility are provided.…”
Section: Discussionmentioning
confidence: 99%
“…Specifically, we show how to obtain adequate representations of least and greatest fixed points in Polyπ through the encoding of initial and final (co)algebras in the λ-calculus. We also straightforwardly derive a strong normalisation result for the higher-order session calculus, which otherwise involves non-trivial proof techniques [5,7,12,13,36]. Future work includes extensions to the classical linear logic-based framework, including multiparty session types [10,11].…”
Section: Related Work and Concluding Remarksmentioning
confidence: 99%