The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We propose a (limited) solution to the problem of constructing stream values defined by recursive equations that do not respect the guardedness condition. The guardedness condition is imposed on definitions of corecursive functions in Coq, AGDA, and other higher-order proof assistants. In this paper, we concentrate in particular on those non-guarded equations where recursive calls appear under functions. We use a correspondence between streams and functions over natural numbers to show thatarXiv:0903.3850v1 fatcat:yadyrfmzd5hgxkux5izbesrnyy