Reduction Strategies for Declarative Programming

DOI10.1016/S1571-0661(04)00273-7zbMath1268.68095OpenAlexW2056173047MaRDI QIDQ2841228

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

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

Related Items (1)

Functional Logic Programming: From Theory to Curry

Cites Work

• Unnamed Item
• Unnamed Item
• Strongly sequential and inductively sequential term rewriting systems
• Programming in equational logic: Beyond strong sequentiality
• A needed narrowing strategy
• Higher-order narrowing with definitional trees
• Lazy narrowing with simplification
• An approach to declarative programming based on a rewriting logic

This page was built for publication: Reduction Strategies for Declarative Programming