Nominal rewriting with name generation: abstraction vs. locality

@inproceedings{Fernndez2005NominalRW,
  title={Nominal rewriting with name generation: abstraction vs. locality},
  author={Maribel Fern{\'a}ndez and Murdoch James Gabbay},
  booktitle={PPDP},
  year={2005}
}
Nominal rewriting extends first-order rewriting with Gabbay-Pitts abstractors: bound entities are named, matching respects α-conversion and can be directly implemented thanks to the use of freshness constraints. In this paper we study two extensions to nominal rewriting. First we introduce a NEW quantifier for modelling name generation and restriction. This allows us to model higher-order functions involving local state, and has also applications in concurrency theory. The second extension… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-5 of 5 references

M

M. Fernández
J. Gabbay and I. Mackie,Nominal Rewriting Systems, ACM Symposium on Principles and Practice of Declarative Programming (PPDP’04), ACM Press • 2004
View 10 Excerpts
Highly Influenced

Higher-order pattern complement and the strict lambda-calculus

ACM Trans. Comput. Log. • 2003
View 3 Excerpts
Highly Influenced

Nominal logic

A. M. Pitts
a first order theory of names and binding, Information and Computation 186 • 2003
View 5 Excerpts
Highly Influenced

V

J.-W. Klop
van Oostrom, and F. van Raamsdonk, Combinatory reduction systems, introduction and survey, Theoretical Computer Science 121 • 1993
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…