Tupling calculation eliminates multiple data traversals

DOI10.1145/258948.258964MaRDI QIDQ5348873zbMATH OpenOpenAlexFDO

Authors Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi, Akihiko Takano

Publication date 21 August 2017

Published in Proceedings of the second ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• A transformation method for dynamic-sized tabulation
• scientific article; zbMATH DE number 3890701
• scientific article; zbMATH DE number 5033861
• Using circular programs to eliminate multiple traversals of data
• scientific article; zbMATH DE number 2018586

Cited in

(12)

• Flattening tuples in an SSA intermediate representation
• A short cut to optimal sequences
• A transformation method for dynamic-sized tabulation
• Asynchronous unfold/fold transformation for fixpoint logic
• scientific article; zbMATH DE number 3890701 (Why is no real title available?)
• The Expression Lemma
• Swapping Arguments and Results of Recursive Functions
• scientific article; zbMATH DE number 2018586 (Why is no real title available?)
• Polynomial-time inverse computation for accumulative functions with multiple data traversals
• scientific article; zbMATH DE number 5033861 (Why is no real title available?)
• Runtime repeated recursion unfolding in CHR: a just-in-time online program optimization strategy that can achieve super-linear speedup
• Using circular programs to eliminate multiple traversals of data

This page was built for publication: Tupling calculation eliminates multiple data traversals

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