Well-definedness of Streams by Transformation and Termination

Details Well-definedness of Streams by Transformation and Termination Well-definedness of Streams by Transformation and Termination

2010-08-16

arxiv.org/abs/1008.2590v2

LMCS 6 (3:21) 2010

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-6(3:21)2010

Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream specification to a term rewriting system (TRS) in such a way that termination of the resulting TRS implies that the stream specification is well-defined, that is, admits a unique solution. As a consequence, proving well-definedness of several interesting stream specifications can be done fully automatically using present powerful tools for proving TRS termination. In order to increase the power of this approach, we investigate transformations that preserve semantics and well-definedness. We give examples for which the above mentioned technique applies for the ransformed specification while it fails for the original one.

Affiliated with

Also associated with

No associations

Rating

Well-definedness of Streams by Transformation and Termination does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Well-definedness of Streams by Transformation and Termination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Well-definedness of Streams by Transformation and Termination will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-177011