Reduction strategies for declarative programming

DOI10.1016/S1571-0661(04)00273-7MaRDI QIDQ2841228zbMATH OpenOpenAlexFDO

Authors Michael Hanus

Publication date 24 July 2013

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

Full work available at URL https://doi.org/10.1016/s1571-0661(04)00273-7

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• Evaluation strategies for functional logic programming
• Evaluation strategies for functional logic programming
• Strategies in programming languages today
• Is strategic programming a viable paradigm?
• A rule-based approach to the implementation of evaluation strategies

Cites work

• A needed narrowing strategy
• An approach to declarative programming based on a rewriting logic
• Higher-order narrowing with definitional trees
• scientific article; zbMATH DE number 1696795 (Why is no real title available?)
• scientific article; zbMATH DE number 1088020 (Why is no real title available?)
• Lazy narrowing with simplification
• Programming in equational logic: Beyond strong sequentiality
• Strongly sequential and inductively sequential term rewriting systems

Cited in

(9)

• Information-gain computation in the \textsc{Fifth} system
• Reducing and vectorizing procedures for telescoping languages
• Is strategic programming a viable paradigm?
• A compiled implementation of strong reduction
• A rule-based approach to the implementation of evaluation strategies
• Constraint based strategies
• Reducing Behavioural to Structural Properties of Programs with Procedures
• scientific article; zbMATH DE number 3476556 (Why is no real title available?)
• Functional Logic Programming: From Theory to Curry

This page was built for publication: Reduction strategies for declarative programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841228)