A theory of RPC calculi for client-server model
From MaRDI portal
Publication:4972065
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.)
Recommendations
- From sequential programs to multi-tier applications by program transformation
- Eliom: A Core ML Language for Tierless Web Programming
- MetaOCaml server pages: web publishing as staged computation
- scientific article; zbMATH DE number 1086679
- The stream-based service-centred calculus: a foundation for service-oriented programming
Cites work
- A multi-tier semantics for Hop
- Automatically RESTful web applications: marking modular serializable continuations
- Design of a separable transition-diagram compiler
- Eliom: A Core ML Language for Tierless Web Programming
- From sequential programs to multi-tier applications by program transformation
- Implementation and use of the PLT scheme web server
- Trampolined style
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)
