File(s) not publicly available
Nominal rewriting systems
presentation
posted on 2023-06-08, 07:25 authored by Maribel Fernández, Murdoch Gabbay, Ian MackieIan MackieWe present a generalisation of ?rst-order rewriting which al- lows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to binding, in which bound entities are explicitly named (rather than using a nameless syntax such as de Bruijn indices), yet we get a rewriting formalism which respects ?-conversion and can be directly implemented. This is achieved by adapt- ing to the rewriting framework the powerful techniques de- veloped by Pitts et al. in the FreshML project. Nominal rewriting can be seen as higher-order rewriting with a ?rst-order syntax and built-in ?-conversion. We show that standard (?rst-order) rewriting is a particular case of nominal rewriting, and that very expressive higher-order systems such as Klop's Combinatory Reduction Systems can be easily de?ned as nominal rewriting systems. Finally we study confluence properties of nominal rewriting
History
Publication status
- Published
Publisher URL
Pages
12.0Presentation Type
- paper
Event name
Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative ProgrammingEvent type
conferenceISBN
1-58113-819-9Department affiliated with
- Informatics Publications
Full text available
- No
Peer reviewed?
- Yes
Legacy Posted Date
2012-02-06Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC