On-demand strategy annotations revisited: an improved on-demand evaluation strategy

DOI10.1016/j.tcs.2009.09.016zbMath1186.68092OpenAlexW2070269010WikidataQ57978172 ScholiaQ57978172MaRDI QIDQ1044842

María Alpuente, Santiago Escobar, Salvador Lucas, Bernhard Gramlich

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.016

zbMATH Keywords

lazy evaluationdeclarative programmingOBJdemandednesson-demand strategy annotations

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items

Context-sensitive dependency pairs, Applications and extensions of context-sensitive rewriting, Termination of Lazy Rewriting Revisited

Uses Software

• BABEL
• OBJ3
• Maude
• AProVE

Cites Work

• Proving termination of context-sensitive rewriting by transformation
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Context-sensitive rewriting strategies
• Lazy Rewriting and Context-Sensitive Rewriting
• Termination of Rewriting with Strategy Annotations
• Logic programming with functions and predicates: The language Babel
• Transformation techniques for context-sensitive rewrite systems
• Term Rewriting and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item