The following is a more recent and up-to-date version of this publication:
The following publications are possibly variants of this publication:
- A Constraint-based Approach to Name Binding and Type Checking using Scope GraphsHendrik van Antwerpen. Master's thesis, Delft University of Technology, January 2016.
- A Theory of Name ResolutionPierre Néron, Andrew P. Tolmach, Eelco Visser, Guido Wachsmuth. ESOP 2015: 205-231 [doi]
- A Language Independent Task Engine for Incremental Name and Type AnalysisGuido Wachsmuth, Gabriël Konat, Vlad A. Vergu, Danny M. Groenewegen, Eelco Visser. Technical Report TUD-SERG-2013-018, 2013.
- A Language Independent Task Engine for Incremental Name and Type AnalysisGuido Wachsmuth, Gabriël Konat, Vlad A. Vergu, Danny M. Groenewegen, Eelco Visser. SLE 2013: 260-280 [doi]
- A Theory of Name Resolution with extended Coverage and ProofsPierre Neron, Andrew P. Tolmach, Eelco Visser, Guido Wachsmuth. Technical Report TUD-SERG-2015-001, 2015.
- A Constraint Language for Static Semantic Analysis based on Scope Graphs with ProofsHendrik van Antwerpen, Pierre Néron, Andrew P. Tolmach, Eelco Visser, Guido Wachsmuth. Technical Report TUD-SERG-2015-012, 2015.
- A constraint language for static semantic analysis based on scope graphsHendrik van Antwerpen, Pierre Néron, Andrew P. Tolmach, Eelco Visser, Guido Wachsmuth. PEPM 2016: 49-60 [doi]
- Knowing When to Ask: Sound scheduling of name resolution in type checkers derived from declarative specifications (Extended Version)Arjen Rouvoet, Hendrik van Antwerpen, Casper Bach Poulsen, Robbert Krebbers, Eelco Visser. Zenodo, Oct 2020. [doi]
- Knowing when to ask: sound scheduling of name resolution in type checkers derived from declarative specificationsArjen Rouvoet, Hendrik van Antwerpen, Casper Bach Poulsen, Robbert Krebbers, Eelco Visser. PACMPL, 4(OOPSLA), 2020. [doi]