Write it recursively

DOI10.1145/1411204.1411229MaRDI QIDQ5178762zbMATH OpenOpenAlexFDO

Authors Akimasa Morihata, Kiminori Matsuzaki, Masato Takeichi

Publication date 16 March 2015

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

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

zbMATH Keywords

finite state automatonoptimal path queryprogram transformationrecursive function

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1953135
• scientific article; zbMATH DE number 2080479
• Algebraic rewritings for optimizing regular path queries.
• Succinct Data Structures for Path Queries
• On the bottom-up evaluation of recursive queries
• scientific article; zbMATH DE number 4106311
• scientific article; zbMATH DE number 5808834
• Succinct representations of weighted trees supporting path queries

Cited in

(1)

• A short cut to optimal sequences

This page was built for publication: Write it recursively

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