United Monoids: Finding Simplicial Sets and Labelled Algebraic Graphs in Trees
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several existing approaches; one of the most recently developed ones...
Main Author: | Mokhov, A. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
AOSA Inc.
2022
|
Subjects: | |
Online Access: | View Fulltext in Publisher |
Similar Items
-
Algebraic Concepts in the Study of Graphs and Simplicial Complexes
by: Zagrodny, Christopher Michael
Published: (2006) -
Simplicial Complexes of Graphs
by: Jonsson, Jakob
Published: (2005) -
Algebras in Monoidal Categories
by: Matsson, Isak
Published: (2021) -
C*-algebras of labeled graphs and *-commuting endomorphisms
by: Willis, Paulette Nicole
Published: (2010) -
Simplicial decompositions and universal graphs
by: Diestal, R.
Published: (1986)