Well-definedness of streams by termination

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

11 Citations (Scopus)
74 Downloads (Pure)

Abstract

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 TRS in such a way that termination of the resulting TRS implies that the stream specification admits a unique solution. As a consequence, proving such well-definedness of several interesting stream specifications can be done fully automatically using present powerful tools for proving TRS termination.
Original languageEnglish
Title of host publicationRewriting Techniques and Applications (20th International Conference, RTA 2009, Brasília, Brazil, June 29-July 1, 2009, Proceedings)
EditorsR. Treinen
Place of PublicationBerlin
PublisherSpringer
Pages164-178
ISBN (Print)978-3-642-02347-7
DOIs
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
Volume5595
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Well-definedness of streams by termination'. Together they form a unique fingerprint.

Cite this