Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleSeptember 2019
Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems
AbstractThe notion of normal forms is ubiquitous in various equivalent transformations. Confluence (CR), one of the central properties of term rewriting systems (TRSs), concerns uniqueness of normal forms. Yet another such property, which is weaker than ...
- ArticleJuly 2005
Program transformation by templates based on term rewriting
PPDP '05: Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programmingPages 59–69https://doi.org/10.1145/1069774.1069780Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformation template. They introduced a second-order matching algorithm of simply-...
- chapterJanuary 1993