Davide Ancona, Sonia Fagorzi & Elena Zucca (2008):
A Parametric Calculus for Mobile Open Code.
In: DCM'07,
ENTCS 192(3).
Elsevier,
pp. 3–22,
doi:10.1016/j.entcs.2008.10.024.
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.
Franco Barbanera, Mariangiola Dezani-Ciancaglini & Ugo de' Liguoro (1995):
Intersection and Union Types: Syntax and Semantics.
Information and Computation 119,
pp. 202–230,
doi:10.1006/inco.1995.1086.
Henk P. Barendregt, Mario Coppo & Maraingiola Dezani-Ciancaglini (1983):
A filter lambda model and the completeness of type assignment.
The Journal of Symbolic Logic 48(4),
pp. 931–940,
doi:10.2307/2273659.
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.
Mario Coppo & Mariangiola Dezani-Ciancaglini (1980):
An extension of the basic functionality theory for the λ-calculus.
Notre Dame Journal of Formal Logic 21(4),
pp. 685–693,
doi:10.1305/ndjfl/1093883253.
Mario Coppo, Mariangiola Dezani-Ciancaglini, Furio Honsell & Giuseppe Longo (1984):
Extended type structures and filter lambda models.
In: Logic colloquium '82.
North-Holland,
pp. 241–262,
doi:10.1016/S0049-237X(08)71819-6.
Mario Coppo, Mariangiola Dezani-Ciancaglini & Maddalena Zacchi (1987):
Type theories, normal forms, and D-lambda-models.
Information and Computation 72(2),
pp. 85–116,
doi:10.1016/0890-5401(87)90042-3.
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 & Oscar Nierstrasz (2008):
A Calculus of Evolving Objects.
Scientific Annals of Computer Science 18,
pp. 63–98.
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):
Extending lambda-calculus with unbind and rebind.
RAIRO - Theoretical Informatics and Applications.
To appear. http://www.disi.unige.it/person/ZuccaE/Research/papers/ITA10.pdf.
Alain Frisch, Giuseppe Castagna & Veronique Benzaken (2008):
Semantic Subtyping: dealing set-theoretically with function, union, intersection, and negation types.
Journal of the ACM 55(4),
pp. 1–64,
doi:10.1145/1391289.1391293.
Extends and supersedes LICS'02 and ICALP/PPDP'05 articles.
Oleg Kiselyov, Chung-chieh Shan & Amr Sabry (2006):
Delimited dynamic binding.
In: ICFP'06.
ACM Press,
pp. 26–37,
doi:10.1145/1159803.1159808.
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 & Frank Pfenning (2005):
Staged computation with names and necessity.
Journal of Functional Programming 15(5),
pp. 893–939,
doi:10.1017/S095679680500568X.
Benjamin C. Pierce (2002):
Types and Programming Languages.
MIT Press.
Gordon Plotkin (1977):
LCF considered as a programming language.
Theoretical Computer Science 5,
pp. 225–255,
doi:10.1016/0304-3975(77)90044-5.
Garrel Pottinger (1980):
A type assignment for the strongly normalizable λ-terms.
In: To H. B. Curry: essays on combinatory logic, lambda calculus and formalism.
Academic Press,
pp. 561–577.
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.
Peter Sewell, James J. Leifer, Keith Wansbrough, Mair Allen-Williams, Francesco Zappa Nardelli, Pierre Habouzit & Viktor Vafeiadis (2007):
Acute: High-level programming language design for distributed computation: Design rationale and language definition.
Journal of Functional Programming 17(4-5),
pp. 547–612,
doi:10.1017/S0956796807006442.
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.
Èric Tanter (2009):
Beyond Static and Dynamic Scope.
In: Dynamic Languages Symposium'09.
ACM Press,
pp. 3–14,
doi:10.1145/1640134.1640137.
Betti Venneri (1994):
Intersection Types as Logical Formulae.
Journal of Logic and Computation 4(2),
pp. 109–124,
doi:10.1093/logcom/4.2.109.
eptcs@eptcs.org