Learn More
Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency common to these settings that can be captured within a single calculus, the Dependency Core Calculus (DCC), a small extension of Moggi's computational lambda calculus. To establish this(More)
We study the stability of the OSPF protocol under steady state and perturbed conditions. We look at three indicators of stability, namely, (a) network convergence times, (b) routing load on processors, and (c) the number of route flaps. We study these statistics under three different scenarios: (a) on networks that deploy OSPF with TE extensions, (b) on(More)
This thesis attempts to make precise the structure inherent in Continuation Passing Style (CPS). We emphasize that CPS translates-calculus into a very basic calculus that does not have functions as primitive. We give an abstract categorical presentation of continuation semantics by taking the continuation type constructor : (or cont in Standard ML of New(More)
We add functional continuations and prompts to a language with an ML-style type system. The operators signicantly extend and simplify the control operators in SML/NJ, and can be themselves used to implement (simple) exceptions. We prove that well-typed terms never produce run-time type errors and give a module for implementing them in the latest version of(More)
In this collection we try to give a n o verview of some selected topics in Domain Theory and Denotational Semantics. In doing so, we rst survey the mathematical universes which have been used as semantic domains. The emphasis is on those ordered structures which have b e e n introduced by Dana Scott in 1969 and which gure under the name (Scott-) domains.(More)
We develop formal methods for reasoning about memory usage at a level of abstraction suitable for establishing or refuting claims about the potential applications of linear logic for static analysis. In particular, we demonstrate a precise relationship between type correctness for a language based on linear logic and the correctness of a reference-counting(More)
We describe a low-level calculus, called ink& (pronounced " links "), designed to serve as an intermediate representation in compilers for class-based object-oriented languages. The calculus fills two roles. First, its primitives can express a wide range of class-based object-oriented language features, such as class construction and various forms of method(More)
Sieber has described a model of PCF consisting of continuous functions that are invariant under certain ((nitary) logical relations, and shown that it is fully abstract for closed terms of up to third-order types. We show that one may achieve full abstraction at all types using a form of \Kripke logical relations" introduced by Jung and Tiuryn to(More)