Classes of equational programs that compile into efficient machine code

DOI10.1007/3-540-51081-8_125MaRDI QIDQ5055738zbMATH OpenOpenAlexFDO

Authors Robert Strandh

Publication date 9 December 2022

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51081-8_125

Mathematics Subject Classification ID

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

Recommendations

• Programming in equational logic: Beyond strong sequentiality
• scientific article; zbMATH DE number 4039260
• Transforming strongly sequential rewrite systems with constructors for efficient parallel execution
• Logic programming with equations
• scientific article; zbMATH DE number 4037157

Cites work

• scientific article; zbMATH DE number 4016172 (Why is no real title available?)
• scientific article; zbMATH DE number 4037157 (Why is no real title available?)
• scientific article; zbMATH DE number 3730111 (Why is no real title available?)
• Efficient string matching
• Fast Pattern Matching in Strings
• PASCAL. User manual and report. Corr. reprint of the 2nd ed
• Pattern Matching in Trees
• Programming with Equations
• Recursive functions of symbolic expressions and their computation by machine, Part I

Cited in

(7)

• Decidable call-by-need computations in term rewriting
• Constructor equivalent term rewriting systems
• scientific article; zbMATH DE number 4016172 (Why is no real title available?)
• Constructor equivalent term rewriting systems are strongly sequential: A direct proof
• Strongly sequential and inductively sequential term rewriting systems
• Strong and NV-sequentiality of constructor systems
• Termination of lazy rewriting revisited

This page was built for publication: Classes of equational programs that compile into efficient machine code

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