Recognizing Strategies

DOI10.1016/j.entcs.2009.03.037zbMath1294.68097OpenAlexW2911400432MaRDI QIDQ5170163

Bastiaan Heeren, Johan Jeuring

Publication date: 22 July 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.03.037

zbMATH Keywords

grammarsparsingstrategiescombinator languagesexercise assistants

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Computer-assisted instruction, e-learning (aspects of mathematics education) (97U50)

Related Items (1)

Specifying rewrite strategies for interactive exercises

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Strongly Typed Rewriting For Coupled Software Transformation
• The Zipper
• Higher-order functions for parsing
• REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
• Building program optimizers with rewriting strategies
• Specifying Strategies for Exercises

This page was built for publication: Recognizing Strategies