当前位置: X-MOL 学术arXiv.cs.PL › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Polymorphic RPC Calculus
arXiv - CS - Programming Languages Pub Date : 2019-10-24 , DOI: arxiv-1910.10988
Kwanghoon Choi, James Cheney, Simon Fowler, Sam Lindley

The RPC calculus is a simple semantic foundation for multi-tier programming languages such as Links in which located functions can be written for the client-server model. Subsequently, the typed RPC calculus is designed to capture the location information of functions by types and to drive location type-directed slicing compilations. However, the use of locations is currently limited to monomorphic ones, which is one of the gaps to overcome to put into practice the theory of RPC calculi for client-server model. This paper proposes a polymorphic RPC calculus to allow programmers to write succinct multi-tier programs using polymorphic location constructs. Then the polymorphic multi-tier programs can be automatically translated into programs only containing location constants amenable to the existing slicing compilation methods. We formulate a type system for the polymorphic RPC calculus, and prove its type soundness. Also, we design a monomorphization translation together with proofs on its type and semantic correctness for the translation.

中文翻译:

多态 RPC 演算

RPC 演算是多层编程语言(例如 Links)的简单语义基础,其中可以为客户端-服务器模型编写定位函数。随后,类型化 RPC 演算旨在按类型捕获函数的位置信息并驱动位置类型导向的切片编译。然而,位置的使用目前仅限于单态的,这是将客户端 - 服务器模型的 RPC 演算理论付诸实践需要克服的差距之一。本文提出了一种多态 RPC 演算,允许程序员使用多态位置构造编写简洁的多层程序。然后可以将多态多层程序自动翻译成仅包含适合现有切片编译方法的位置常量的程序。我们为多态 RPC 演算制定了一个类型系统,并证明了它的类型健全性。此外,我们设计了一个单态化翻译,并证明了翻译的类型和语义正确性。
更新日期:2020-05-26
down
wechat
bug