Summary: Choice in Dynamic Linking
, Georges Gonthier2
, and Benjamin Werner3
University of California at Santa Cruz
INRIA - Futurs and LIX, Projet LogiCal, P^ole Commun de Recherche en
Informatique du Plateau de Saclay, INRIA, CNRS, E. Polytechnique et U. Paris-Sud
Abstract. We introduce a computational interpretation for Hilbert's
choice operator (). This interpretation yields a typed foundation for
dynamic linking in software systems. The use of choice leads to inter-
esting difficulties--some known from proof theory and others specific to
the programming-language perspective that we develop. We therefore
emphasize an important special case, restricting the nesting of choices.
We define and investigate operational semantics. Interestingly, computa-
tion does not preserve types but it is type-sound.