Strategic polymorphism requires just two combinators!

Ralf Lämmel, Joost Visser. Strategic polymorphism requires just two combinators!. CoRR, cs.PL/0212048, 2002. [doi]

@article{cs-PL-0212048,
  title = {Strategic polymorphism requires just two combinators!},
  author = {Ralf Lämmel and Joost Visser},
  year = {2002},
  url = {http://arxiv.org/abs/cs.PL/0212048},
  note = {informal publication},
  tags = {programming languages, rule-based, completeness, meta programming, generic programming, meta-model, modeling language, modeling, traversal, term rewriting, language modeling, functional programming, language design, Haskell, graph-rewriting, programming paradigms, strategic programming, Strategic term rewriting, programming, Meta-Environment, rewriting, design, coverage, systematic-approach, rewriting strategies, domain-specific language},
  researchr = {https://researchr.org/publication/cs-PL-0212048},
  cites = {0},
  citedby = {0},
  journal = {CoRR},
  volume = {cs.PL/0212048},
}