A Theory of Name Resolution with extended Coverage and Proofs

Title

A Theory of Name Resolution with extended Coverage and Proofs

 Author

Neron, P.J.M.
Tolmach, A.P.
Visser, E.
Wachsmuth, G.

Faculty

Electrical Engineering, Mathematics and Computer Science

 Department

Software and Computer Technology

 Date

2015-01-30

 Abstract

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. We illustrate the approach using a small example language with modules. In addition, we show how our approach provides a model for a range of name binding patterns in existing languages.

 Subject

name binding

 To reference this document use:

http://resolver.tudelft.nl/uuid:66855bba-1349-45e1-920b-ca590ec015de

 ISSN

1872-5392

 Source

Technical Report Series TUD-SERG-2015-001

 Part of collection

Institutional Repository

 Document type

report

 Rights

© 2015 The Author(s)
Software Engineering Research Group, Department of Software Technology, Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology
Files
PDF TUD-SERG-2015-001.pdf 852.41 KB
Close viewer