Scopes as types

Antwerpen, Hendrik van; Poulsen, Casper Bach; Rouvoet, Arjen; Visser, Eelco

doi:10.1145/3276484

Cited by 34 publications

(32 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The syntax and static semantics of CBS have been formally defined in [14] using the declarative metalanguages SDF3 and NaBL2. The NaBL2 definition of CBS type checking needs to be reformulated in the new Statix meta-language [3], to specify rigorous subtype checks, after which the IDE generated from the definition of CBS is to be released as an Eclipse plugin.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

A Component-Based Formal Language Workbench

Mosses¹

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The CBS framework supports component-based specification of programming languages. It aims to significantly reduce the effort of formal language specification, and thereby encourage language developers to exploit formal semantics more widely. CBS provides an extensive library of reusable language specification components, facilitating co-evolution of languages and their specifications.After introducing CBS and its formal definition, this short paper reports work in progress on generating an IDE for CBS from the definition. It also considers the possibility of supporting componentbased language specification in other formal language workbenches.

show abstract

Section: Resultsmentioning

confidence: 99%

“…The rules also check whether the syntax patterns used in specifications of translation functions match the specified grammar alternatives. NaBL2 is to be superseded by a more powerful meta-language, Statix [3], which should support full CBS type checking.…”

Section: Definition Of the Cbs Meta-languagementioning

confidence: 99%

A Component-Based Formal Language Workbench

Mosses¹

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…Separately, Lin has also devised a (relational) algebraic procedure for binding resolution in various (imperative) languages, based on fact extraction [26]. Related to this is the recent work on scope graphs for name resolution [32] and static type checking [7]. This is a generic framework for specifying (and checking) static semantics of languages (including binding resolution), but it does not contain anything that supports or directly corresponds to our notion of value extension.…”

Section: Related Workmentioning

confidence: 99%

Characterising renaming within OCaml’s module system: theory and implementation

Rowe

Férée

Thompson

et al. 2019

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

We present an abstract, set-theoretic denotational semantics for a signiicant subset of OCaml and its module system in order to reason about the correctness of renaming value bindings. Our abstract semantics captures information about the binding structure of programs. Crucially for renaming, it also captures information about the relatedness of diferent declarations that is induced by the use of various diferent language constructs (e.g. functors, module types and module constraints). Correct renamings are precisely those that preserve this structure. We demonstrate that our semantics allows us to prove various high-level, intuitive properties of renamings. We also show that it is sound with respect to a (domain-theoretic) denotational model of the operational behaviour of programs. This formal framework has been implemented in a prototype refactoring tool for OCaml that performs renaming. module type Stringable = sig type t val to_string : t -> string end module Pair(X : Stringable)(Y : Stringable) = struct type t = X.t * Y.t let to_string (x, y) = (X.to_string x)^" "^(Y.to_string y) end module Int = struct type t = int let to_string i = int_to_string i end module String = struct type t = string let to_string s = s end module P = Pair(Int)(Pair(String)(Int)) ;; print_endline (P.to_string (0, ("!=", 1))) ;;Characterising Renaming within OCaml's Module System PLDI '19, June 22ś26, 2019, Phoenix, AZ, USA While the paper describes the work in the context of OCaml modules, the approach can be used to understand aspects of (re)naming in other languages, such as Haskell (classes and instances), and Java (interfaces).

show abstract

“…As the basis for our investigations we use Statix, a constraint language developed for the specification of type systems [21]. Statix is built around scope graphs, a language-independent model for name binding and name resolution [20].…”

Section: Towards Language-parametric Semantic Editor Services Based Omentioning

confidence: 99%

“…Statix is a recently introduced meta-language for the specification of static semantics [21], based on scope graphs and constraints [10,20]. We chose Statix because it allows us to declare semantic editor services in terms of constraints and type system specifications.…”

Section: Introduction To Statixmentioning

confidence: 99%

Towards language-parametric semantic editor services based on declarative type system specifications

Pelsmaeker

Antwerpen

Visser

2019

Proceedings Companion of the 2019 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: So

Self Cite

View full text Add to dashboard Cite

Editor services assist programmers to more effectively write and comprehend code. Implementing editor services correctly is not trivial. This paper focuses on the specification of semantic editor services, those that use the semantic model of a program. The specification of refactorings is a common subject of study, but many other semantic editor services have received little attention. We propose a language-parametric approach to the definition of semantic editor services, using a declarative specification of the static semantics of the programming language, and constraint solving. Editor services are specified as constraint problems, and language specifications are used to ensure correctness. We describe our approach for the following semantic editor services: reference resolution, find usages, goto subclasses, code completion, and the extract definition refactoring. We do this in the context of Statix, a constraint language for the specification of type systems. We investigate the specification of editor services in terms of Statix constraints, and the requirements these impose on a suitable solver.

show abstract

Scopes as types

Cited by 34 publications

References 41 publications

A Component-Based Formal Language Workbench

A Component-Based Formal Language Workbench

Characterising renaming within OCaml’s module system: theory and implementation

Towards language-parametric semantic editor services based on declarative type system specifications

Contact Info

Product

Resources

About