paperbot · PL 论文追踪

RSS

The Power-Set Construction for Tree Algebras

LMCS vol.Volume 19, Issue 42023
Achim Blumensath

尚未生成 AI 速览(可能缺少 API key 或等待下次运行补跑)。

原文摘要(Abstract)

We study power-set operations on classes of trees and tree algebras. Our main result consists of a distributive law between the tree monad and the upwards-closed power-set monad, in the case where all trees are assumed to be linear. For non-linear ones, we prove that such a distributive law does not exist.

链接与引用

DOI 原文 ·

BibTeX
@article{paperbot2186,
  title = {The Power-Set Construction for Tree Algebras},
  author = {Achim Blumensath},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 19, Issue 4},
  year = {2023},
  doi = {10.46298/lmcs-19(4:9)2023}
}