A complete formal semantic description of a practical programming language (such as Java) is likely to be a lengthy document, regardless of which semantic framework is being used. Good modularity of the description is important to the person(s) developing it, to facilitate reuse, change, and extensi
The rewriting logic semantics project
✍ Scribed by José Meseguer; Grigore Roşu
- Book ID
- 108281275
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 625 KB
- Volume
- 373
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We consider (a slight v ariant of) the ccs calculus, and we analyze two operational semantics de ned in the literature: the rst exploits Proved Transition Systems (pts) and the second Rewriting Logic (rl). We s h o w that the interleaving interpretation of both semantics agree, in that they de ne th
The Constraint Logic Programming (CLP) Scheme was introduced by Jaar and Lassez. The scheme gave a formal framework, based on constraints, for the basic operational, logical and algebraic semantics of an extended class of logic programs. This paper presents for the ®rst time the semantic foundations