A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
It is our aim to develop an elementary strong functional programming (ESFP) system. To be useful, ESFP should include structures such as streams which can be computationally unwound in nitely often. We describe a syntactic analysis to ensure that in nitely proceeding structures, which we shall term codata, are productive. This analysis is an extension of the check for guardedness that has been used with de nitions over coinductive types in Martin-L of's type theory and in the calculus ofdoi:10.1007/bfb0000493 fatcat:3rr2gcypm5fffc6hqyrxfcjxmu