Extending the lambda-calculus with unbind and rebind
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 45 (2011) no. 1, p. 143-162

We extend the simply typed λ-calculus with unbind and rebind primitive constructs. That is, a value can be a fragment of open code, which in order to be used should be explicitly rebound. This mechanism nicely coexists with standard static binding. The motivation is to provide an unifying foundation for mechanisms of dynamic scoping, where the meaning of a name is determined at runtime, rebinding, such as dynamic updating of resources and exchange of mobile code, and delegation, where an alternative action is taken if a binding is missing. Depending on the application scenario, we consider two extensions which differ in the way type safety is guaranteed. The former relies on a combination of static and dynamic type checking. That is, rebind raises a dynamic error if for some variable there is no replacing term or it has the wrong type. In the latter, this error is prevented by a purely static type system, at the price of more sophisticated types.

DOI : https://doi.org/10.1051/ita/2011008
Classification:  68N15,  68N18
Keywords: lambda calculus, type systems, static and dynamic scoping, rebinding
     author = {Dezani-Ciancaglini, Mariangiola and Giannini, Paola and Zucca, Elena},
     title = {Extending the lambda-calculus with unbind and rebind},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     publisher = {EDP-Sciences},
     volume = {45},
     number = {1},
     year = {2011},
     pages = {143-162},
     doi = {10.1051/ita/2011008},
     zbl = {1220.68045},
     mrnumber = {2776858},
     language = {en},
     url = {http://www.numdam.org/item/ITA_2011__45_1_143_0}
Dezani-Ciancaglini, Mariangiola; Giannini, Paola; Zucca, Elena. Extending the lambda-calculus with unbind and rebind. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 45 (2011) no. 1, pp. 143-162. doi : 10.1051/ita/2011008. http://www.numdam.org/item/ITA_2011__45_1_143_0/

[1] D. Ancona, S. Fagorzi and E. Zucca, A parametric calculus for mobile open code. Electronic Notes in Theoretical Computer Science 192 (2008) 3-22. | Zbl 1277.68158

[2] G. Bierman, M.W. Hicks, P. Sewell, G. Stoyle and K. Wansbrough, Dynamic rebinding for marshalling and update, with destruct-time λ, in ICFP'03. ACM Press (2003), 99-110.

[3] L. Dami, A lambda-calculus for dynamic binding. Theoret. Comput. Sci. 192 (1997) 201-231. | MR 1604023 | Zbl 0895.68015

[4] M. Dezani-Ciancaglini, P. Giannini and O. Nierstrasz, A calculus of evolving objects. Scientific Annals of Computer Science (2008) 63-98. | MR 2497357

[5] M. Dezani-Ciancaglini, P. Giannini and E. Zucca, Intersection types for unbind and rebind, in ITRS'10. Electronic Proceedings in Theoretical Computer Science 45 (2010) 45-59. | Zbl 1264.03045

[6] O. Kiselyov, C.-C. Shan and A. Sabry, Delimited dynamic binding, in ICFP'06, ACM Press (2006), 26-37.

[7] L. Moreau, A syntactic theory of dynamic binding. Higher Order and Symbolic Computation 11 (1998) 233-279. | Zbl 0934.68038

[8] P. Sewell, J.J. Leifer, K. Wansbrough, M. Allen-Williams, F.Z. Nardelli, P. Habouzit and V. Vafeiadis, Acute: High-level programming language design for distributed computation: Design rationale and language definition. J. Funct. Prog. 17 (2007) 547-612. | MR 2347716 | Zbl 1125.68023

[9] W. Taha and T. Sheard, MetaML and multi-stage programming with explicit annotations. Theoret. Comput. Sci. 248 (2000) 211-242. | Zbl 0949.68047

[10] É. Tanter, Beyond static and dynamic scope, in DLS'09. ACM Press (2009), 3-14.