Termination in Higher-Order Concurrent Calculi

Demangeon, Romain; Hirschkoff, Daniel; Sangiorgi, Davide

doi:10.1007/978-3-642-11623-0_4

Cited by 7 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

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

On Polymorphic Sessions and Functions

Toninho¹,

Yoshida

2021

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

This work exploits the logical foundation of session types to determine what kind of type discipline for the Λ-calculus can exactly capture, and is captured by, Λ-calculus behaviours. Leveraging the proof theoretic content of the soundness and completeness of sequent calculus and natural deduction presentations of linear logic, we develop the first mutually inverse and fully abstract processes-as-functions and functions-as-processes encodings between a polymorphic session π-calculus and a linear formulation of System F. We are then able to derive results of the session calculus from the theory of the Λ-calculus: (1) we obtain a characterisation of inductive and coinductive session types via their algebraic representations in System F; and (2) we extend our results to account for value and process passing, entailing strong normalisation.

show abstract

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%

On Polymorphic Sessions and Functions

Toninho¹,

Yoshida

2021

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

show abstract

“…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%

Mobile Processes and Termination

Demangeon

Hirschkoff

Sangiorgi

2009

Semantics and Algebraic Specification

Self Cite

View full text Add to dashboard Cite

Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensure termination of the process computations. Two approaches are exposed. The rst one draws on the method of logical relations, which has been extensively used in the analysis of sequential languages. The second approach exploits notions from term rewriting.

show abstract

“…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%

On Polymorphic Sessions and Functions

Toninho

Yoshida

2018

Programming Languages and Systems

View full text Add to dashboard Cite

This work exploits the logical foundation of session types to determine what kind of type discipline for the π-calculus can exactly capture, and is captured by, λ-calculus behaviours. Leveraging the proof theoretic content of the soundness and completeness of sequent calculus and natural deduction presentations of linear logic, we develop the first mutually inverse and fully abstract processes-as-functions and functionsas-processes encodings between a polymorphic session π-calculus and a linear formulation of System F. We are then able to derive results of the session calculus from the theory of the λ-calculus: (1) we obtain a characterisation of inductive and coinductive session types via their algebraic representations in System F; and (2) we extend our results to account for value and process passing, entailing strong normalisation.

show abstract

Termination in Higher-Order Concurrent Calculi

Cited by 7 publications

References 8 publications

On Polymorphic Sessions and Functions

On Polymorphic Sessions and Functions

Mobile Processes and Termination

On Polymorphic Sessions and Functions

Contact Info

Product

Resources

About