A polymorphic RPC calculus

Choi, Kwanghoon; Cheney, James; Fowler, Simon; Lindley, Sam

doi:10.1016/j.scico.2020.102499

Cited by 6 publications

(18 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 5 shows a type system for the polymorphic RPC calculus [5] that can identify remote procedure calls at the type level, supporting location polymorphism. The type language allows function types 𝐴 𝐿𝑜𝑐 − −− → 𝐵.…”

Section: The Type Systemmentioning

confidence: 99%

“…The type soundness of the type system for the polymorphic RPC calculus, which was formulated as Theorem 3.1 and was proved by [5], guarantees that every remote procedure call thus identified statically will never change to a local procedure call under evaluation. This enables compilers to generate call instructions for local calls and network communication for remote calls safely even though both are in the same syntax of lambda applications.…”

Section: 𝑟𝑝𝑐mentioning

confidence: 99%

“…An important feature of multi-tier programming languages is the ability to specify locations where code should run. RPC calculi [4,5,8] offer a promising, yet lightweight, semantic foundation for multi-tier programming: Firstly, programmers have only to add location annotations, for example, c for client and s for server, to lambda abstractions to write remote procedures such as 𝜆 c 𝑥 .𝑀 and 𝜆 s 𝑥 .𝑀. Secondly, remote procedure calls are as simple as local calls, reusing the standard function application syntax.…”

mentioning

confidence: 99%

“…In previous work introducing the polymorphic RPC calculus, 𝜆 ∀ 𝑟𝑝𝑐 , [5], it was proposed to implement polymorphic locations by a so called monomorphisation translation, which translates polymorphically located programs into monomorphic ones at compile time, by specialising each location-polymorphic function and compiling it once for each possible location assignment of concrete locations to polymorphic location variables. On top of existing monomorphically typed RPC calculi [4], this translation could be used as the basis for an implementation of the polymorphic RPC calculus.…”

mentioning

confidence: 99%

“…In this paper, we design a polymorphic Client-Server (CS) calculus, 𝜆 ∀ 𝑐𝑠 , and a type-based slicing compilation of the polymorphic RPC calculus into 𝜆 ∀ 𝑐𝑠 . Prior CS calculi [4,5,7] and their slicing compilers are untyped. In (typed or untyped) CS calculi, the client part is clearly separated from the server part, and communication between the two is inserted automatically.…”

mentioning

confidence: 99%

See 4 more Smart Citations

A Typed Slicing Compilation of the Polymorphic RPC Calculus

Choi¹,

Cheney²,

Lindley³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

The polymorphic RPC calculus allows programmers to write succinct multitier programs using polymorphic location constructs. However, until now it lacked an implementation. We develop an experimental programming language based on the polymorphic RPC calculus. We introduce a polymorphic Client-Server (CS) calculus with the client and server parts separated. In contrast to existing untyped CS calculi, our calculus is not only able to resolve polymorphic locations statically, but it is also able to do so dynamically. We design a type-based slicing compilation of the polymorphic RPC calculus into this CS calculus, proving type and semantic correctness. We propose a method to erase types unnecessary for execution but retaining locations at runtime by translating the polymorphic CS calculus into an untyped CS calculus, proving semantic correctness. CCS CONCEPTS• Software and its engineering → Compilers; Distributed programming languages; Client-server architectures.

show abstract

Section: The Type Systemmentioning

confidence: 99%

Section: 𝑟𝑝𝑐mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations