Abstract for "A Core Calculus of Dependency"

A Core Calculus of Dependency
Martín Abadi, Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. Submitted for publication, 1998.

Abstract: 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 many 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 thesis, we translate typed calculi for secure information flow, binding-time analysis, slicing, and call-tracking into DCC. The translations help clarify subtle aspects of the source calculi. We also define a semantic model for DCC and use it to give simple proofs of the respective noninterference results for each case.