D. Ancona & E. Zucca (2002):
A Calculus of Module Systems.
Journal of Functional Programming 12(2),
pp. 91–132,
doi:10.1017/S0956796801004257.
Davide Ancona & Eugenio Moggi (2004):
A Fresh Calculus for Name Management.
In: GPCE'04,
LNCS 3286.
Springer,
pp. 206–224,
doi:10.1007/978-3-540-30175-2_11.
Gavin Bierman, Michael W. Hicks, Peter Sewell, Gareth Stoyle & Keith Wansbrough (2003):
Dynamic Rebinding for Marshalling and Update, with Destruct-Time λ.
In: ICFP'03.
ACM Press,
pp. 99–110,
doi:10.1145/944705.944715.
Laurent Dami (1997):
A Lambda-Calculus for Dynamic Binding.
Theoretical Computer Science 192(2),
pp. 201–231,
doi:10.1016/S0304-3975(97)00150-3.
Mariangiola Dezani-Ciancaglini, Paola Giannini & Elena Zucca (2009):
The essence of static and dynamic bindings.
In: ICTCS'09.
http://www.disi.unige.it/person/ZuccaE/Research/papers/ICTCS09-DGZ.pdf.
Mariangiola Dezani-Ciancaglini, Paola Giannini & Elena Zucca (2010):
Intersection Types for Unbind and Rebind.
In: Elaine Pimentel, Betti Venneri & Joe Wells: ITRS'10 - Intersection Types and Related Systems,
EPTCS 45,
pp. 45–58,
doi:10.4204/EPTCS.45.4.
Mariangiola Dezani-Ciancaglini, Paola Giannini & Elena Zucca (2011):
Extending the lambda-calculus with unbind and rebind.
RAIRO - Theoretical Informatics and Applications 45(1),
pp. 143–162,
doi:10.1051/ita/2011008.
C. Barry Jay (2004):
The pattern calculus.
ACM Trans. Program. Lang. Syst. 26(6),
pp. 911–937,
doi:10.1145/1034774.1034775.
Luc Moreau (1998):
A Syntactic Theory of Dynamic Binding.
Higher Order and Symbolic Computation 11(3),
pp. 233–279,
doi:10.1023/A:1010087314987.
Aleksandar Nanevski (2003):
From dynamic binding to state via modal possibility.
In: PPDP'03.
ACM,
pp. 207–218,
doi:10.1145/888251.888271.
Aleksandar Nanevski & Frank Pfenning (2005):
Staged computation with names and necessity.
Journal of Functional Programming 15(5),
pp. 893–939,
doi:10.1017/S095679680500568X.
Aleksandar Nanevski, Frank Pfenning & Brigitte Pientka (2008):
Contextual modal type theory.
ACM Transactions on Computer Logic 9(3),
doi:10.1145/1352582.1352591.
Lukas Rytz & Martin Odersky (2010):
Named and default arguments for polymorphic object-oriented languages.
In: OOPS'10.
ACM Press,
pp. 2090–2095,
doi:10.1145/1774088.1774529.
Walid Taha & Tim Sheard (2000):
MetaML and multi-stage programming with explicit annotations.
Theoretical Computer Science 248(1-2),
pp. 211–242,
doi:10.1016/S0304-3975(00)00053-0.
eptcs@eptcs.org