Structural recursion for querying ordered graphs

From MaRDI portal

Revision as of 19:22, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5244813

Jump to:navigation, search

DOI10.1145/2500365.2500608zbMath1323.68241OpenAlexW2161061431MaRDI QIDQ5244813

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

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

optimization bisimulation ordered graphs structural recursion graph query language

Mathematics Subject Classification ID

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

Related Items (3)

Fregel: a functional domain-specific language for vertex-centric large-scale graph processing ⋮ Unnamed Item ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5244813&oldid=19873747"