| L. Meertens. Algorithms - Towards Programming as a Mathematical Activity. In Proceedings of CWI Symposium on Mathematics and Computer Science, pages 289--334. North-Holland, 1986. 24 |
....and conversion between different collection kinds is captured as a homomorphism from one collection kind to another. The collection monoids used in the approach are essentially monads and homomorphism between collection monoids is effectively governed by the Boom hierarchy of data structures [25]. A collection kind can be converted into another collection kind lower in the hierarchy but not the other way round, e.g. a list can be converted into a set but not a set to a list. Part of the collection algebra, the monoid homomorphism described above, and the monad morphism described in [39] ....
L. Meertens. Algorithms - Towards Programming as a Mathematical Activity. In Proceedings of CWI Symposium on Mathematics and Computer Science, pages 289--334. North-Holland, 1986. 24
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