REVIEW 1 cited by
Recognisable languages over monads
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of composing structures into bigger structures. It so happens that category theory has an abstract concept for this, namely a monad. The goal of this paper is to propose monads as a unifying framework for discussing existing algebras and designing new algebras.
Forward citations
Cited by 1 Pith paper
-
Dynamic Membership for Regular Tree Languages
Dynamic membership for any fixed regular tree language is maintained in O(log n / log log n) per relabeling, with an exact constant-time class under a standard hardness conjecture.
Discussion (0). Continue with ORCID to comment.