Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
The state of the art in language workbenches: Conclusions from the language workbench challenge
Abstract Language workbenches are tools that provide high-level mechanisms for the
implementation of (domain-specific) languages. Language workbenches are an active area …
implementation of (domain-specific) languages. Language workbenches are an active area …
Evaluating and comparing language workbenches: Existing results and benchmarks for the future
Abstract Language workbenches are environments for simplifying the creation and use of
computer languages. The annual Language Workbench Challenge (LWC) was launched in …
computer languages. The annual Language Workbench Challenge (LWC) was launched in …
A theory of name resolution
We describe a language-independent theory for name binding and resolution, suitable for
programming languages with complex sco** rules including both lexical sco** and …
programming languages with complex sco** rules including both lexical sco** and …
Intrinsically-typed definitional interpreters for imperative languages
C Bach Poulsen, A Rouvoet, A Tolmach… - Proceedings of the …, 2017 - dl.acm.org
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 …
known) semantics of a host language, enabling understanding and validation of the …
Language design with the spoofax language workbench
IDEs are essential for programming language developers, and state-of-the-art IDE support is
mandatory for programming languages to be successful. Although IDE features for …
mandatory for programming languages to be successful. Although IDE features for …
A constraint language for static semantic analysis based on scope graphs
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 …
binding structure and performing name resolution in an AST-independent way. In this paper …
A language designer's workbench: a one-stop-shop for implementation and verification of language designs
The realization of a language design requires multiple artifacts that redundantly encode the
same information. This entails significant effort for language implementors, and often results …
same information. This entails significant effort for language implementors, and often results …
Scope graphs: The story so far
A Zwaan, H van Antwerpen - Eelco Visser Commemorative …, 2023 - drops.dagstuhl.de
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 …
aspect of programming languages. However, it is usually treated in an unprincipled manner …
Hyperast: Enabling efficient analysis of software histories at scale
Abstract Syntax Trees (ASTs) are widely used beyond compilers in many tools that measure
and improve code quality, such as code analysis, bug detection, mining code metrics …
and improve code quality, such as code analysis, bug detection, mining code metrics …
[PDF][PDF] Language Composition via Kind-Typed Symbol Tables.
The modularization of domain-specific modeling languages (DSMLs) fosters individual
reuse of DSMLs in different contexts. Within this article, we discuss how it is possible to refer …
reuse of DSMLs in different contexts. Within this article, we discuss how it is possible to refer …