A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting

19 pages•Published: June 19, 2013

Abstract

In this paper we present a novel condensed narrowing-like semantics that contains the minimal information which is needed to describe compositionally all possible rewritings of a term rewriting system. We provide its goal-dependent top-down definition and, more importantly, an equivalent goal-independent bottom-up fixpoint characterization.
We prove soundness and completeness w.r.t. the small-step behavior of rewriting for the full class of term rewriting systems.

Keyphrases: bottom up semantics, term rewriting, term rewriting systems

In: Laura Kovacs and Temur Kutsia (editors). SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science, vol 15, pages 31-49.

Links:	https://easychair.org/publications/paper/Pzf
	https://doi.org/10.29007/cpt8

BibTeX entry

@inproceedings{SCSS2013:Condensed_Goal_Independent_Fixpoint,
  author    = {Marco Comini and Luca Torella},
  title     = {A Condensed Goal-Independent Fixpoint Semantics Modeling the Small-Step Behavior of Rewriting},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Pzf},
  doi       = {10.29007/cpt8},
  pages     = {31-49},
  year      = {2013}}

Download PDF Open PDF in browser