Searched for: author:"Neron, P."
(1 - 4 of 4)
document
Van Antwerpen, H. (author), Néron, P. (author), Tolmach, A. (author), Visser, E. (author), Wachsmuth, G. (author)
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, we show how to use scope graphs to build static semantic analyzers. We use constraints extracted from the AST to specify facts about binding, typing, and initialization. We...
report 2015
document
Vergu, V. (author), Neron, P. (author), Visser, E. (author)
The formal definition the semantics of a programming language and its implementation are typically separately defined, with the risk of divergence such that properties of the formal semantics are not properties of the implementation. In this paper, we present DynSem, a domain-specific language for the specification of the dynamic semantics of...
report 2015
document
Van Antwerpen, H. (author), Néron, P. (author), Tolmach, A. (author), Visser, E. (author), Wachsmuth, G. (author)
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, we show how to use scope graphs to build static semantic analyzers. We use constraints extracted from the AST to specify facts about binding, typing, and initialization. We...
report 2015
document
Van Antwerpen, H. (author), Neron, P. (author), Tolmach, A. (author), Visser, E. (author), Wachsmuth, G. (author)
We extend and combine two existing declarative formalisms, the scope graphs of Neron et al. and type constraint systems, to build a language-independent theory that can describe both name and type resolution for realistic languages with complex scope and typing rules. Unlike conventional static semantics presentations, our approach maintains a...
report 2015
Searched for: author:"Neron, P."
(1 - 4 of 4)