Scope graphs are a promising generic framework to model the binding structures of
programming languages, bridging formalization and implementation, supporting the …

A definitional interpreter defines the semantics of an object language in terms of the (well-
known) semantics of a host language, enabling understanding and validation of the …

Static name binding (ie, associating references with appropriate declarations) is an essential
aspect of programming languages. However, it is usually treated in an unprincipled manner …

We present a type system over language definitions that classifies parts of the operational
semantics of a language in input, and models a common language design organization. The …

Correct by Construction Language Implementations Page 1 Delft University of Technology
Correct by Construction Language Implementations Rouvoet, AJ DOI 10.4233/uuid:f0312839-3444-41ee-9313-b07b21b59c11 …

We present an abstract, set-theoretic denotational semantics for a significant subset of
OCaml and its module system, allowing to reason about the correctness of renaming value …

To warrant programmer productivity, type checker results should be correct and available
quickly. Correctness can be provided when a type checker implementation corresponds to a …

DynSem is a domain-specific language for concise specification of the dynamic semantics of
programming languages, aimed at rapid experimentation and evolution of language …

DynSem is a domain-specific language for concise specification of the dynamic semantics of
programming languages, aimed at rapid experimentation and evolution of language …

Giving auto-completion candidates for dynamically typed languages requires complex
analysis of the source code, especially when the goal is to ensure that the completion …