A core calculus of dependency

by: Mart∈ Abadi, Anindya Banerjee, Nevin Heintze, Jon G Riecke

edited by: M Ac

(1999), pp. 147-160.

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

amorkan, kozima, kontakte, scavadini, mrkoot, tesissvc

Find related articles with these CiteULike tags

analysis, calculus, dependence, dependency, dependent, information_flow, lambda-calculi, modal-logic, monadic, no-tag, particular, purity, type

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 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 thesis, we translate typed calculi for secure information flow, binding-time analysis, slicing, and call-tracking into DCC. The...

@inproceedings{citeulike:404329, 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 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 thesis, we translate typed calculi for secure information flow, binding-time analysis, slicing, and call-tracking into DCC. The...}, address = {New York, NY, USA}, author = {Abadi, Mart\'\in and Banerjee, Anindya and Heintze, Nevin and Riecke, Jon G. }, booktitle = {POPL '99. Proceedings of the 26th {ACM} {SIGPLAN-{SIGACT}} on Principles of programming languages, January 20--22, 1999, San Antonio, {TX}}, citeulike-article-id = {404329}, editor = {Ac, M. }, keywords = {dependency, lambda-calculi, modal-logic}, pages = {147--160}, posted-at = {2006-02-12 09:09:07}, priority = {2}, publisher = {ACM Press}, title = {A core calculus of dependency}, url = {http://citeseer.ist.psu.edu/abadi99core.html}, year = {1999} }

RIS record

TY - CONF ID - citeulike:404329 L3 - citeulike-article-id:404329 TI - A core calculus of dependency T2 - POPL '99. Proceedings of the 26th {ACM} {SIGPLAN-{SIGACT}} on Principles of programming languages, January 20--22, 1999, San Antonio, {TX} SP - 147 EP - 160 AD - New York, NY, USA PB - ACM Press N2 - 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 thesis, we translate typed calculi for secure information flow, binding-time analysis, slicing, and call-tracking into DCC. The... KW - dependency KW - lambda-calculi KW - modal-logic AU - Abadi, Mart\'\in AU - Banerjee, Anindya AU - Heintze, Nevin AU - Riecke, Jon A2 - Ac, M PY - 1999/// UR - http://citeseer.ist.psu.edu/abadi99core.html ER -

RIS BibTeX