Article contents
Constraining rule-based dynamics with types
Published online by Cambridge University Press: 28 February 2013
Abstract
A generalised framework of site graphs is introduced in order to provide the first fully semantic definition of the side-effect-free core of the rule-based language Kappa. This formalisation allows the use of types either to confirm that a rule respects a certain invariant or to guide a restricted refinement process that allows us to constrain its run-time applicability.
- Type
- Paper
- Information
- Mathematical Structures in Computer Science , Volume 23 , Special Issue 2: Developments In Computational Models 2010 , April 2013 , pp. 272 - 289
- Copyright
- Copyright © Cambridge University Press 2013
References
- 7
- Cited by