Robustness of Equations Under Operational Extensions
Sound behavioral equations on open terms may become unsound after conservative extensions of the underlying operational semantics. Providing criteria under which such equations are preserved is extremely useful; in particular, it can avoid the need to repeat proofs when extending the specified langu...
Main Authors: | Peter D. Mosses, MohammadReza Mousavi, Michel A. Reniers |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2010-11-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1011.6435v1 |
Similar Items
-
A Modular Structural Operational Semantics for Delimited Continuations
by: Neil Sculthorpe, et al.
Published: (2016-06-01) -
A Component-Based Formal Language Workbench
by: Peter D. Mosses
Published: (2019-12-01) -
Analysis of Boolean Equation Systems through Structure Graphs
by: Michel A. Reniers, et al.
Published: (2010-02-01) -
Mathematical semantics and compiler generation
by: Mosses, Peter David
Published: (1975) -
Robust PCA and its Extension
by: Cheng-Yu Hung, et al.
Published: (2018)