Checking equivalence of corecursive streams: An inductive procedure

In recent work, non-periodic streams have been defined corecursively, by representing them with finitary equational systems built on top of various operators, besides the standard constructor. When only the stream constructor is allowed in equations, only periodic streams can be represented, and the...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1009; s. 114680
Hlavní autori:	Ancona, Davide, Barbieri, Pietro, Zucca, Elena
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 12.09.2024
Predmet:	Operational semantics Regular trees Stream programming Stream programming Operational semantics Regular trees
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!