Unification and combination of iterative insertion strategies with rudimentary traversals and failure
Logic in Computer Science
2019-04-25 v1 Symbolic Computation
Abstract
We introduce a new class of extensions of terms that consists in navigation strategies and insertion of contexts. We introduce an operation of combination on this class which is associative, admits a neutral element and so that each extension is idempotent. The class of extension is also shown to be closed by combination, with a constructive proof. This new framework is general and independent of any application semantics. However it has been introduced for the kernel of a software tool which aims at aiding derivation of multiscale partial differential equation models.
Keywords
Cite
@article{arxiv.1904.10901,
title = {Unification and combination of iterative insertion strategies with rudimentary traversals and failure},
author = {Walid Belkhir and Nicolas Ratier and Duy Duc Nguyen Michel Lenczner},
journal= {arXiv preprint arXiv:1904.10901},
year = {2019}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1904.07668