Scope Graphs: The Story so Far

Aron Zwaan*, Hendrik van Antwerpen

*Corresponding author for this work

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

1 Citation (Scopus)
22 Downloads (Pure)

Abstract

Static name binding (i.e., associating references with appropriate declarations) is an essential aspect of programming languages. However, it is usually treated in an unprincipled manner, often leaving a gap between formalization and implementation. The scope graph formalism mitigates these deficiencies by providing a well-defined, first-class, language-parametric representation of name binding. Scope graphs serve as a foundation for deriving type checkers from declarative type system specifications, reasoning about type soundness, and implementing editor services and refactorings. In this paper we present an overview of scope graphs, and, using examples, show how the ideas and notation of the formalism have evolved. We also briefly discuss follow-up research beyond type checking, and evaluate the formalism.

Original languageEnglish
Title of host publicationEelco Visser Commemorative Symposium, EVCS 2023
EditorsRalf Lammel, Peter D. Mosses, Friedrich Steimann
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Number of pages13
ISBN (Electronic)9783959772679
DOIs
Publication statusPublished - 2023
Event2023 Eelco Visser Commemorative Symposium, EVCS 2023 - Delft, Netherlands
Duration: 5 Apr 20235 Apr 2023

Publication series

NameOpenAccess Series in Informatics
Volume109
ISSN (Print)2190-6807

Conference

Conference2023 Eelco Visser Commemorative Symposium, EVCS 2023
Country/TerritoryNetherlands
CityDelft
Period5/04/235/04/23

Keywords

  • name binding
  • reference resolution
  • scope graph
  • static semantics
  • type system

Fingerprint

Dive into the research topics of 'Scope Graphs: The Story so Far'. Together they form a unique fingerprint.

Cite this