A theory of RPC calculi for client-server model

From MaRDI portal
Publication:4972065

DOI10.1017/S0956796819000029zbMATH Open1493.68083arXiv2110.15183OpenAlexW2923169781WikidataQ128188969 ScholiaQ128188969MaRDI QIDQ4972065FDOQ4972065

Byeong-Mo Chang, Kwanghoon Choi

Publication date: 22 November 2019

Published in: Journal of Functional Programming (Search for Journal in Brave)

Abstract: With multi-tier programming languages, programmers can specify the locations of code to run in order to reduce development efforts for the web-based client-server model where programmers write client and server programs separately and test the multiple programs together. The RPC calculus, one of the foundations of those languages by Cooper and Wadler, has the feature of symmetric communication in programmer's writing arbitrarily deep nested client-server interactions. However, the existing research only considers dynamically typed locations. We propose a typed RPC calculus where locations are tracked in type-level. A new located type system paves the way for a theory of RPC calculi for the client-server model. (In the following papers published in SCP2020 and PPDP2021, the typed RPC calculus will be enhanced with polymorphic locations and a type-based slicing compilation.)


Full work available at URL: https://arxiv.org/abs/2110.15183




Recommendations



Cites Work


Cited In (1)

Uses Software





This page was built for publication: A theory of RPC calculi for client-server model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972065)