| E. Albert, C. Ferri, F. Steiner, and G. Vidal. Improving functional logic programs by difference-lists. In Advances in Computing Science, Penang, Malaysia, Proceedings, volume 1961. |
....comparison with a list elimination approach by shortcut deforestation for polymorphically recursive workers in Section 7.1. Example 3. Consider the following specification of a function inits that returns the list of initial segments of its argument list e.g. inits [1. 4] 1] 1, 2] [1, 2,3], 1, 2,3,4] inits : inits [ inits (x : xs) map (x : inits xs) By abstracting from the list constructors of the outer result list including map and using Theorem 3, inits can be replaced by: l = vanish ,rev,map (ln c a r m let f [ ....
....with a list elimination approach by shortcut deforestation for polymorphically recursive workers in Section 7.1. Example 3. Consider the following specification of a function inits that returns the list of initial segments of its argument list e.g. inits [1. 4] 1] 1, 2] 1, 2,3] [1, 2,3,4]] inits : inits [ inits (x : xs) map (x : inits xs) By abstracting from the list constructors of the outer result list including map and using Theorem 3, inits can be replaced by: l = vanish ,rev,map (ln c a r m let f [ c n f (x : ....
[Article contains additional citation context not shown here]
E. Albert, C. Ferri, F. Steiner, and G. Vidal. Improving functional logic programs by difference-lists. In Advances in Computing Science, Penang, Malaysia, Proceedings, volume 1961.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC