@inbook{ce89ec9c04f44c46be8a32bf40b6becc,

title = "Using structural recursion for corecursion",

abstract = "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 that some classes of non-guarded definitions can be modelled through the encoding as structural recursive functions. In practice, this work extends the class of stream values that can be defined in a constructive type theory-based theorem prover with inductive and coinductive types, structural recursion and guarded corecursion.",

keywords = "Constructive Type Theory, Structural Recursion, Coinductive types, Guarded Corecursion, Coq",

author = "Yves Bertot and Ekaterina Komendantskaya",

year = "2009",

doi = "10.1007/978-3-642-02444-3_14",

language = "English",

isbn = "9783642024436",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "220--236",

editor = "Stefano Berardi and Ferruccio Damiani and Ugo de{\textquoteright}Liguoro",

booktitle = "Types for Proofs and Programs",

address = "United States",

}