Structural recursion for querying ordered graphs

DOI10.1145/2500365.2500608MaRDI QIDQ5244813zbMATH OpenOpenAlexFDO

Authors Soichiro Hidaka, Kazuyuki Asada, Zhenjiang Hu, Hiroyuki Kato, Keisuke Nakano

Publication date 30 March 2015

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

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

zbMATH Keywords

bisimulationgraph query languageoptimizationordered graphsstructural recursion

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Structural recursion as a query language on lists and ordered trees
• Advances in Databases and Information Systems
• Functional programming with structured graphs
• The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
• Functional programming with graphs

Cited in

(8)

• Structural recursion as a query language on lists and ordered trees
• The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
• Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity
• scientific article; zbMATH DE number 7437711 (Why is no real title available?)
• Fregel: a functional domain-specific language for vertex-centric large-scale graph processing
• Functional programming with structured graphs
• Advances in Databases and Information Systems
• Automata, Languages and Programming

This page was built for publication: Structural recursion for querying ordered graphs

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