Checked corecursive streams: Expressivity and completeness

Checked corecursive streams are a novel approach to stream definitions relying on a semantics of function application detecting cyclic calls, and a well-definedness check ensuring that access to an arbitrary index will always return a result. We extend the technique beyond the simple stream operator...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 974; p. 114081
Main Authors: Ancona, Davide, Barbieri, Pietro, Zucca, Elena
Format: Journal Article
Language:English
Published: Elsevier B.V 29.09.2023
Subjects:
Operational semantics
Runtime checking
Stream programming
Stream programming
Operational semantics
Runtime checking
ISSN:0304-3975
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Checked corecursive streams are a novel approach to stream definitions relying on a semantics of function application detecting cyclic calls, and a well-definedness check ensuring that access to an arbitrary index will always return a result. We extend the technique beyond the simple stream operators considered in previous work, notably by adding an interleaving combinator which has a non-trivial recursion scheme. We show that this actually enhances expressive power, since the interleaving operator cannot be expressed by the others, and that it is still possible to perform a sound and complete well-definedness check, through a symbolic computation which mimics access to an arbitrary index. •Formal investigation of the expressive power of the calculus.•Proof that the interleaving operator cannot be expressed by other operators.•Enhanced well-formedness runtime check sound and complete with respect to termination of access.
ISSN:0304-3975
DOI:10.1016/j.tcs.2023.114081