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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1009; S. 114680
Hauptverfasser:	Ancona, Davide, Barbieri, Pietro, Zucca, Elena
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 12.09.2024
Schlagworte:	Operational semantics Regular trees Stream programming Stream programming Operational semantics Regular trees
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!