JSW 2017 Vol.12(7): 570-580 ISSN: 1796-217X
doi: 10.17706/jsw.12.7.570-580
doi: 10.17706/jsw.12.7.570-580
Big-step and Small-Step Semantics of the Call-by-Name RPC Calculus
Keishi Watanabe*, Shin-ya Nishizaki
Tokyo Institute of Technology, 2-12-1-W8-69, Ookayama, Meguroku, Tokyo 152-8552, Japan.
Abstract—A remote procedure call (RPC) is a network communication technique between distributed computers. RPC is more approachable than the other network communication techniques since a programmer can use it in a similar manner to a procedure call in a sequential program on a single CPU computer. Cooper and Wadler proposed the RPC calculus and formalized the remote procedure call in the style of the lambda calculus. They used the call-by-value evaluation strategy for the RPC calculus. We may say that the RPC calculus is an extension of the traditional call-by-value lambda calculus by attaching a location. In the previous work, we developed a big-step semantics of the call-by-name RPC calculus and studied the translation of the call-by-name RPC calculus into the call-by name RMI calculus, in order to show the expressive power of the RMI calculus. In this paper, we newly propose a small-step semantics of the call-by-name RPC calculus. We prove the equivalence between the small-step and big-step semantics.
Index Terms—programming language theory, functional programming language, lambda calculus, operational semantics, remote procedure call, RPC calculus.
Abstract—A remote procedure call (RPC) is a network communication technique between distributed computers. RPC is more approachable than the other network communication techniques since a programmer can use it in a similar manner to a procedure call in a sequential program on a single CPU computer. Cooper and Wadler proposed the RPC calculus and formalized the remote procedure call in the style of the lambda calculus. They used the call-by-value evaluation strategy for the RPC calculus. We may say that the RPC calculus is an extension of the traditional call-by-value lambda calculus by attaching a location. In the previous work, we developed a big-step semantics of the call-by-name RPC calculus and studied the translation of the call-by-name RPC calculus into the call-by name RMI calculus, in order to show the expressive power of the RMI calculus. In this paper, we newly propose a small-step semantics of the call-by-name RPC calculus. We prove the equivalence between the small-step and big-step semantics.
Index Terms—programming language theory, functional programming language, lambda calculus, operational semantics, remote procedure call, RPC calculus.
Cite: Keishi Watanabe, Shin-ya Nishizaki, "Big-step and Small-Step Semantics of the Call-by-Name RPC Calculus," Journal of Software vol. 12, no. 7, pp. 570-580, 2017.
General Information
ISSN: 1796-217X (Online)
Frequency: Quarterly
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, CNKI, Google Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsweditorialoffice@gmail.com
-
Mar 01, 2024 News!
Vol 19, No 1 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Nov 02, 2023 News!
Vol 18, No 4 has been published with online version [Click]