Functional programming with graphs

DOI10.1145/258948.258955MaRDI QIDQ5348865zbMATH OpenOpenAlexFDO

Authors Martin Erwig

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.258955

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Functional programming and lambda calculus (68N18)

Recommendations

• Functional programming with structured graphs
• scientific article; zbMATH DE number 108369
• scientific article; zbMATH DE number 1086663
• scientific article; zbMATH DE number 42964
• Functional graphs
• scientific article; zbMATH DE number 1923047
• Graph applications in programming

Cited in

(11)

• Simple rectangle-based functional programs for computing reflexive-transitive closures
• Structural recursion for querying ordered graphs
• Folding over neural networks
• Graph traversal and graph transformation
• Inductive graphs and functional graph algorithms
• Using relations to develop a Haskell program for computing maximum bipartite matchings
• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
• Fregel: a functional domain-specific language for vertex-centric large-scale graph processing
• Functional programming with structured graphs
• Implementing the \(\lambda_{GT}\) language: a functional language with graphs as first-class data
• Relational depth-first-search with applications

This page was built for publication: Functional programming with graphs

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