Proofs and types
Extracting &ohgr;'s programs from proofs in the calculus of constructions
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strictness analysis: a new perspective based on type inference
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Binding time analysis: a new PERspective
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Handbook of logic in computer science (vol. 2)
Analysis and caching of dependencies
Proceedings of the first ACM SIGPLAN international conference on Functional programming
The SLam calculus: programming with secrecy and integrity
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Polymorphic Binding-Time Analysis
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Extending Pruning Techniques to Polymorphic Second order Lambda-Calculus
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Strictness Analysis in Logical Form
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Detecting and Removing Dead-Code using Rank 2 Intersection
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
A formalization of Static Analyses in System F
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Boolean Constraints for Binding-Time Analysis
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Type-Based Useless-Code Elimination for Functional Programs
SAIG '00 Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation
Statically assuring secrecy for dynamic concurrent processes
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A conjunctive type system for useless-code elimination
Mathematical Structures in Computer Science
Automatic useless-code elimination for HOT functional programs
Journal of Functional Programming
Security policy in a declarative style
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Taming non-compositionality using new binders
UC'07 Proceedings of the 6th international conference on Unconventional Computation
| Hi-index | 0.00 |
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.