Higher-order matching for program transformation-Reference-Cited by-同舟云学术

Higher-order matching for program transformation

Published:2001-10 Issue:1-2 Volume:269 Page:135-162
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

de Moor Oege,Sittampalam Ganesh

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference25 articles.

1. The TrafoLa-H Subsystem;Alt,1993

2. T. Biggerstaff, Pattern matching for program generation: a user manual, Tech. Report MSR TR-98-55, Mircosoft Research, 1998. Available from URL: [http://www.research.microsoft.com/∼tedb/Publications.htm.]

3. The promotion and accumulation strategies in functional programming;Bird;ACM Trans. Programming, Languages Systems,1984

4. Introduction to Functional Programming in Haskell, International Series in Computer Science;Bird,1998

5. A restricted form of higher-order rewriting applied to an HDL semantics;Boulton,1995

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Higher Order Patterns for Rewrite Rules;Proceedings of the 17th ACM SIGPLAN International Haskell Symposium;2024-08-28

2. Pattern-based calculi with finitary matching;Logic Journal of the IGPL;2017-12-29

3. Quoted staged rewriting: a practical approach to library-defined optimizations;ACM SIGPLAN Notices;2017-12

4. Quoted staged rewriting: a practical approach to library-defined optimizations;Proceedings of the 16th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences;2017-10-23

5. Squid: type-safe, hygienic, and reusable quasiquotes;Proceedings of the 8th ACM SIGPLAN International Symposium on Scala;2017-10-22