Choice in dynamic linking

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

We introduce a computational interpretation for Hubert's choice operator ( ε). This interpretation yields a typed foundation for dynamic linking in software systems. The use of choice leads to interesting 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, computation does not preserve types but it is type-sound.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsIgor Walukiewicz
PublisherSpringer Verlag
Pages12-26
Number of pages15
ISBN (Print)3540212981, 9783540212980
DOIs
Publication statusPublished - 1 Jan 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2987
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Choice in dynamic linking'. Together they form a unique fingerprint.

Cite this