We describe a language-independent theory for name binding and resolution, suitable for programming languages with complex scoping rules including both lexical scoping and modules. We formulate name resolution as a two stage problem. First a language-independent scope graph is constructed using language-specific rules from an abstract syntax tree. Then references in the scope graph are resolved to corresponding declarations using a language-independent resolution process. We introduce a resolution calculus as a concise, declarative, and language-independent specification of name resolution. We develop a resolution algorithm that is sound and complete with respect to the calculus. Based on the resolution calculus we develop language-independent definitions of alpha-equivalence and rename refactoring.
Tue 14 AprDisplayed time zone: Azores change
16:30 - 18:00
|A Theory of Name Resolution|
|A Core Calculus for XQuery 3.0: Combining Navigational and Pattern Matching Approaches|
|IsoLate: A Type System for Self-Recursion|
Ravi Chugh University of Chicago