Behavioral Polymorphism and Parametricity in Session-Based Communication

Caires, Luís; Pérez, Jorge A.; Pfenning, Frank; Toninho, Bernardo

doi:10.1007/978-3-642-37036-6_19

Cited by 57 publications

(108 citation statements)

References 26 publications

(66 reference statements)

Supporting

Mentioning

107

Contrasting

Order By: Relevance

“…The "recursion" here is an instance of an equirecursive session type [10]; some logical underpinnings are available for coinductive types [22]. We also use polymorphism intuitively; a formal development can be found in [4].…”

Section: Linear Logic and Session Typesmentioning

confidence: 99%

“…Variations apply for both intuitionistic [5,6] and classical [24] linear logic. This has enabled the application of proof-theoretic techniques in this domain, for example, developing logical relations [17], corecursion [22], and parametricity and behavioral polymorphism [4]. It has also given rise to the design of SILL, a modular extension of an underlying functional language with session-typed concurrency [21].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Polarized Substructural Session Types

Pfenning

Griffith

2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The deep connection between session-typed concurrency and linear logic is embodied in the language SILL that integrates functional and message-passing concurrent programming. The exacting nature of linear typing provides strong guarantees, such as global progress, absence of deadlock, and race freedom, but it also requires explicit resource management by the programmer. This burden is alleviated in an affine type system where resources need not be used, relying on a simple form of garbage collection. In this paper we show how to effectively support both linear and affine typing in a single language, in addition to the already present unrestricted (intuitionistic) types. The approach, based on Benton's adjoint construction, suggests that the usual distinction between synchronous and asynchronous communication can be viewed through the lens of modal logic. We show how polarizing the propositions into positive and negative connectives allows us to elegantly express synchronization in the type instead of encoding it by extra-logical means.

show abstract

Section: Linear Logic and Session Typesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Polarized Substructural Session Types

Pfenning

Griffith

2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Another work [43] explores a typed behavioural theory for their logically motivated binary session calculus. In [6], they extend these works to polymorphism and parametricity. They demonstrate the importance of encodings into session calculi for a fine-grained analysis of higher-order functions.…”

Section: Related Workmentioning

confidence: 98%

“…We can instantiate our encoding for the more general setting of first-class references. This relies on extending our session calculus with session polymorphism [5,6]. Effects are F = P({rd ρ τ, wr ρ τ, alloc ρ τ | ∀ρ, τ }), where ρ are regions, with (F, ∪, ∅), ⊕ = ∪, and F * = F .…”

Section: Session Effectsmentioning

confidence: 99%

Effects as sessions, sessions as effects

OrchardDominic¹,

Yoshida²

2016

SIGPLAN Not.

View full text Add to dashboard Cite

Effect and session type systems are two expressive behavioural type systems. The former is usually developed in the context of the lambda-calculus and its variants, the latter for the pi-calculus. In this paper we explore their relative expressive power. Firstly, we give an embedding from PCF, augmented with a parameterised effect system, into a session-typed pi-calculus (session calculus), showing that session types are powerful enough to express effects. Secondly, we give a reverse embedding, from the session calculus back into PCF, by instantiating PCF with concurrency primitives and its effect system with a session-like effect algebra; effect systems are powerful enough to express sessions. The embedding of session types into an effect system is leveraged to give a new implementation of session types in Haskell, via an effect system encoding. The correctness of this implementation follows from the second embedding result. We also discuss various extensions to our embeddings.

show abstract

“…This formalization draws from existing work [55] that combines functional and message-passing concurrent computation based on linear logic. After those extensions and formalization, we would like to tackle the introduction of polymorphism in the sense of behavioral polymorphism [16] to facilitate generic data structures and affine types [52] to allow garbage collection of processes.…”

Section: Future Workmentioning

confidence: 99%

Objects as session-typed processes

Balzer

Pfenning

2015

Proceedings of the 5th International Workshop on Programming Based on Actors, Agents, and Decentralized Control

Self Cite

View full text Add to dashboard Cite

A key idea in object-oriented programming is that objects encapsulate state and interact with each other by message exchange. This perspective suggests a model of computation that is inherently concurrent (to facilitate simultaneous message exchange) and that accounts for the effect of message exchange on an object's state (to express valid sequences of state transitions). In this paper we show that such a model of computation arises naturally from session-based communication. We introduce an object-oriented programming language that has processes as its only objects and employs linear session types to express the protocols of message exchange and to reason about concurrency and state. Based on various examples we show that our language supports the typical patterns of object-oriented programming (e.g., encapsulation, dynamic dispatch, and subtyping) while guaranteeing session fidelity in a concurrent setting. In addition, we show that our language facilitates new forms of expression (e.g., type-directed reuse, internal choice), which are not available in current object-oriented languages. We have implemented our language in a prototype compiler.

show abstract

Behavioral Polymorphism and Parametricity in Session-Based Communication

Cited by 57 publications

References 26 publications

Polarized Substructural Session Types

Polarized Substructural Session Types

Effects as sessions, sessions as effects

Objects as session-typed processes

Contact Info

Product

Resources

About