scientific article; zbMATH DE number 3970093

From MaRDI portal
Publication:3736894





[For the entire collection see Zbl 0595.00023.] We describe a basis for extending Backus's FP languages to apply to infinite data objects, including streams, using data objects called prefixes, which can be viewed as approximations of either finite or infinite sequences. The resulting set of data objects, together with its limit points, admits not only an infinite number of entries in a sequence, but also infinitely nested expressions. Elements in this domain include arbitrarily good finite approximations to any of the infinite objects of the domain. We also describe a mechanism for extending the primitive functions of an FP language over its domain to a corresponding stream FP language (or SFP language) capable of handling both finite and infinite elements over the extended domain. Extensions of the common functional forms are described. The algebra of FP programs is preserved nearly unchanged. Example programs are given.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3736894)