Explore a 17-minute conference talk from ACM SIGPLAN's OOPSLA that delves into the monadic and comonadic aspects of dependency analysis. Discover how this presentation addresses limitations of the Dependency Core Calculus (DCC) by introducing an alternative dependency calculus inspired by category theory. Learn about the unification of monadic and comonadic approaches, which subsumes both DCC and the binding-time calculus λ°. Gain insights into novel techniques for proving correctness of dependency analysis and understand how standard categorical concepts explain DCC's nonstandard bind rule and protection judgment. Examine alternative proofs of correctness for DCC and λ°, enhancing your understanding of foundational frameworks in computer science applications such as secure information flow analysis and binding-time analysis.