Functional programming with graphs
From MaRDI portal
Publication:5348865
DOI10.1145/258948.258955zbMath1369.68095OpenAlexW1989439909MaRDI QIDQ5348865
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
Functional programming and lambda calculus (68N18) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Graph traversal and graph transformation ⋮ Fregel: a functional domain-specific language for vertex-centric large-scale graph processing ⋮ Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures ⋮ Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings ⋮ Folding over neural networks ⋮ Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures ⋮ Relational depth-first-search with applications
This page was built for publication: Functional programming with graphs
