Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich theory partly due to their ubiquity in mathematics and computer science. Stream differential equations are a coinductive method for specifying streams and stream operations, and their theory has been developed in many papers over the past two decades. In this paper we present a survey of the many results in this area. Our focus is on the classification of different formats of stream differential equations, their solution methods, and the classes of streams they can define. Moreover, we describe in detail the connection between the so-called syntactic solution method and abstract GSOS
We study various operations for partitioning, projecting and merging streams of data. These operatio...
Using (stream) differential equations for definitions and coinduction for proofs, we define, analyse...
Streams are infinite sequences over a given data type. A stream specification is a set of equations ...
Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich the...
Streams, or infinite sequences, are infinite objects of a very simple type,yet they have a rich theo...
Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich the...
In this article we give an accessible introduction to stream differential equations, ie., equations ...
Contains fulltext : 168720.pdf (publisher's version ) (Open Access
AbstractBased on the presence of a final coalgebra structure on the set of streams (infinite sequenc...
This paper shows how to reason about streams concisely and precisely. Streams, infinite sequences of...
Stream processing is a term that is used widely in the literature to describe a variety of systems. ...
We develop a coinductive calculus of streams based on the presence of a final coalgebra structure on...
Based on the presence of a final coalgebra structure on the set of streams (infinite sequences of re...
Stream processing is a term that is used widely in the literature to describe a variety of systems. ...
We consider recursion equations (∗) FX = t(F,X) where X ranges over streams (i.e., elements of S: = ...
We study various operations for partitioning, projecting and merging streams of data. These operatio...
Using (stream) differential equations for definitions and coinduction for proofs, we define, analyse...
Streams are infinite sequences over a given data type. A stream specification is a set of equations ...
Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich the...
Streams, or infinite sequences, are infinite objects of a very simple type,yet they have a rich theo...
Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich the...
In this article we give an accessible introduction to stream differential equations, ie., equations ...
Contains fulltext : 168720.pdf (publisher's version ) (Open Access
AbstractBased on the presence of a final coalgebra structure on the set of streams (infinite sequenc...
This paper shows how to reason about streams concisely and precisely. Streams, infinite sequences of...
Stream processing is a term that is used widely in the literature to describe a variety of systems. ...
We develop a coinductive calculus of streams based on the presence of a final coalgebra structure on...
Based on the presence of a final coalgebra structure on the set of streams (infinite sequences of re...
Stream processing is a term that is used widely in the literature to describe a variety of systems. ...
We consider recursion equations (∗) FX = t(F,X) where X ranges over streams (i.e., elements of S: = ...
We study various operations for partitioning, projecting and merging streams of data. These operatio...
Using (stream) differential equations for definitions and coinduction for proofs, we define, analyse...
Streams are infinite sequences over a given data type. A stream specification is a set of equations ...