Blog
About

1
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      A theory of RPC calculi for client–server model

      ,

      Journal of Functional Programming

      Cambridge University Press (CUP)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          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. The feature of the calculus is fully implemented by asymmetric communication in trampolined style suitable for the client–server model. However, the existing research only considers a stateless server strategy in which all server states are encoded for transmission to the client so that server states do not need to be stored in the server. It cannot always correctly handle all stateful operations involving disks or databases. To resolve this problem, we first propose new stateful calculi that fully support both symmetric communication from the programmer’s viewpoint and asymmetric communication in its implementation using trampolined style. All the existing calculi either provide only the feature of asymmetric communication or propose only symmetric implementation suitable for the peer-to-peer model, rather than the client–server model. Second, the method used to design our stateful server strategy is based on a new locative type system which paves the way for a theory of RPC calculi for the client–server model. Besides proposing the new stateful calculi, this theory can improve the existing stateless server strategy to construct new state-encoding calculi that eliminate runtime checks on remote procedure calls present in the existing strategy, and it enables us to design a new mixed strategy that combines the benefits of both kinds of strategies. As far as we know, there are no typed multi-tier calculi that offer programmers the feature of symmetric communication with the implementation of asymmetric communication under the three strategies together.

          Related collections

          Most cited references 27

          • Record: found
          • Abstract: not found
          • Conference Proceedings: not found

          Definitional interpreters for higher-order programming languages

           John Reynolds (1972)
            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            The essence of compiling with continuations

              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              Types and Subtypes for Client-Server Interactions

                Bookmark

                Author and article information

                Journal
                Journal of Functional Programming
                J. Funct. Prog.
                Cambridge University Press (CUP)
                0956-7968
                1469-7653
                2019
                March 22 2019
                2019
                : 29
                Article
                10.1017/S0956796819000029
                © 2019

                Comments

                Comment on this article