Hendrik van Antwerpen

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In previous work, we introduced scope graphs as a formalism for describing program binding structure and performing name resolution in an AST-independent way. In this paper, we show how to use scope graphs to build static semantic analyzers. We use constraints extracted from the AST to specify facts about binding, typing, and initialization. We treat name(More)
  • 1