An initial algebra approach to term rewriting systems with variable binders

@article{Hamana2006AnIA,
  title={An initial algebra approach to term rewriting systems with variable binders},
  author={Makoto Hamana},
  journal={Higher-Order and Symbolic Computation},
  year={2006},
  volume={19},
  pages={231-262}
}
We present an extension of first-order term rewriting systems. It involves variable binding in the term language. We develop systems called binding term rewriting systems (BTRSs) in a stepwise manner. First we present the term language, then formulate equational logic. Finally, we define rewriting systems. This development is novel because we follow the initial algebra approach in an extended notion of -algebras in various functor categories. These are based on Fiore-Plotkin-Turi’s presheaf… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 56 REFERENCES

Another meta-language for programming with bound names modulo renaming

  • G. Plotkin
  • Winter Workshop in Logics, Types and Rewriting…
  • 2000
Highly Influential
8 Excerpts

The calculus of algebraic constructions

  • F. Blanqui, Jouannaud, J.-P., M. Okada
  • Rewriting Techniques and Applications (RTA…
  • 1999
Highly Influential
7 Excerpts

An initial algebra approach to the specification, correctness and implementation of abstract data types

  • J. Goguen, J. Thatcher, E. Wagner
  • Technical Report RC 6487, IBM T. J. Watson…
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…