Simplifying reductions

DOI10.1145/1111037.1111041MaRDI QIDQ5348911zbMATH OpenOpenAlexFDO

Authors

Publication date 21 August 2017

Published in Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1111037.1111041

zbMATH Keywords

equational programmingincremental computationloop optimizationpolyhedral modelprogram transformation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 3943006
• High-level language support for user-defined reductions
• An interleaving transformation for parallelizing reductions for distributed-memory parallel machines
• scientific article; zbMATH DE number 1273691
• Lambda calculus with algebraic simplification for reduction parallelisation: extended study

Cited in

(9)

• Reductivity
• Value-free reductions
• Reduction Under Substitution
• Finding Reductions Automatically
• Reduced direct products
• scientific article; zbMATH DE number 1222831 (Why is no real title available?)
• Lazy narrowing with simplification
• scientific article; zbMATH DE number 1975594 (Why is no real title available?)
• High-level language support for user-defined reductions

This page was built for publication: Simplifying reductions

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