Logical Semantics for the Rewriting Calculus
✍ Scribed by Aaron Stump; Carsten Schürmann
- Book ID
- 108126478
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 252 KB
- Volume
- 125
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
## Abstract In this paper we propose a new set of rules for a judgement calculus, i.e. a typed lambda calculus, based on Intuitionistic Linear Logic; these rules ease the problem of defining a suitable mathematical semantics. A proof of the canonical form theorem for this new system is given: it as
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