The transient combinator, higher-order strategies, and the distributed data problem

DOI10.1016/j.scico.2004.03.006zbMath1091.68544OpenAlexW2152431579MaRDI QIDQ1887674

Mahadevan Subramaniam, Victor L. Winter

Publication date: 22 November 2004

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2004.03.006

zbMATH Keywords

Program transformationHigher-order rewritingJava virtual machineDistributed data problemHigher-order strategic programmingHigher-order traversalSandia secure processorSkip strategyTransient combinator

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

A higher-order strategy for eliminating common subexpressions

Uses Software

• Stratego
• Maude
• Polyp

This page was built for publication: The transient combinator, higher-order strategies, and the distributed data problem