Conference item

Polytypic Downwards Accumulations

Abstract:: A downwards accumulation is a higher-order operation that distributes information downwards through a data structure, from the root towards the leaves. The concept was originally introduced in an ad hoc way for just a couple of kinds of tree. We generalize the concept to an arbitrary polynomial datatype; our generalization proceeds via the notion of a path in such a datatype.

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Gibbons, J. (1998). Polytypic Downwards Accumulations. Proceedings of Mathematics of Program Construction, 1422.

MLA Style

Gibbons, J. “Polytypic Downwards Accumulations.” Proceedings of Mathematics of Program Construction, vol. 1422, Springer−Verlag, 1998.

Chicago Style

Gibbons, J. 1998. “Polytypic Downwards Accumulations.” In Proceedings of Mathematics of Program Construction. Vol. 1422. Springer−Verlag.
Share
Print

Authors

+ Gibbons, J More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Computer Science
Role:: Author

Publisher:: Springer−Verlag
Host title:: Proceedings of Mathematics of Program Construction
Volume:: 1422
Publication date:: 1998-06-01

UUID:: uuid:440ac942-ef3e-4cd0-9456-78ad6a939a01
Local pid:: cs:2349
Deposit date:: 2015-03-12

Terms of use

Copyright date:: 1998

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP