Pith. sign in

REVIEW 1 cited by

Recognisable languages over monads

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 1502.04898 v1 pith:7WBIJ6MP submitted 2015-02-17 cs.LO

Miko{l}aj Bojańczyk This is my paper · ORCID
classification cs.LO
keywords structuresalgebrasmonadstheoryabstractalgebraicbehindbigger
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Dynamic Membership for Regular Tree Languages

    cs.FL 2025-04 accept novelty 7.0 of 10

    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.

Pith tools