Paper: A Static Calculus of Dependencies for the λ-Cube (at LICS 2000)

Authors: Frédéric Prost

Abstract

Dependency analysis aims at identifying how different parts of a program depend on each other's. It is the kernel of many issues in program analysis such as dead-code, binding time, strictness, program slicing etc. We address the problem of dependency analysis in the context of typed \math-calculus. We consider all systems of the \math-cube and extend them conservatively by the addition of new typing rules in order to determine which parts of a \math-term may contribute to its evaluation. We show how typing information can be used to statically identify dependencies.

BibTeX

  @InProceedings{Prost-AStaticCalculusofDe,
    author = 	 {Frédéric Prost},
    title = 	 {A Static Calculus of Dependencies for the λ-Cube},
    booktitle =  {Proceedings of the Fifteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2000)},
    year =	 {2000},
    month =	 {June}, 
    pages =      {267--276},
    location =   {Santa Barbara, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }