On second-order iterative monads

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00181889" target="_blank" >RIV/68407700:21230/11:00181889 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.tcs.2011.04.027" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2011.04.027</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.tcs.2011.04.027" target="_blank" >10.1016/j.tcs.2011.04.027</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On second-order iterative monads

Popis výsledku v původním jazyce

B. Courcelle studied algebraic trees as precisely the solutions of all recursive program schemes for a given signature in Set. He proved that the corresponding monad is iterative. We generalize this to recursive program schemes over a given unitary endofunctor H of a "suitable" category. A monad is called second-order iterative if every guarded recursive program scheme has a unique solution in it. We construct two second-order iterative monads: one, called the second-order rational monad, S(H), is proved to be the initial second-order iterative monad. The other one, called the context-free monad, C(H), is a quotient of S(H) and in the original case of a polynomial endofunctor H of Set we prove that C(H) is the monad studied by B. Courcelle. The question whether these two monads are equal is left open. (C) 2011 Elsevier B.V. All rights reserved.

Název v anglickém jazyce

On second-order iterative monads

Popis výsledku anglicky

B. Courcelle studied algebraic trees as precisely the solutions of all recursive program schemes for a given signature in Set. He proved that the corresponding monad is iterative. We generalize this to recursive program schemes over a given unitary endofunctor H of a "suitable" category. A monad is called second-order iterative if every guarded recursive program scheme has a unique solution in it. We construct two second-order iterative monads: one, called the second-order rational monad, S(H), is proved to be the initial second-order iterative monad. The other one, called the context-free monad, C(H), is a quotient of S(H) and in the original case of a polynomial endofunctor H of Set we prove that C(H) is the monad studied by B. Courcelle. The question whether these two monads are equal is left open. (C) 2011 Elsevier B.V. All rights reserved.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

—

Svazek periodika

412

Číslo periodika v rámci svazku

38

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

20

Strana od-do

4969-4988

Kód UT WoS článku

000294317000002

EID výsledku v databázi Scopus

—