Journal article

Generic 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 regular datatype; the resulting definition is co-inductive.

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. (2000). Generic Downwards Accumulations. Science of Computer Programming, 37, 37–65.

MLA Style

Gibbons, J. “Generic Downwards Accumulations.” Science of Computer Programming, vol. 37, 2000, pp. 37–65.

Chicago Style

Gibbons, J. 2000. “Generic Downwards Accumulations.” Science of Computer Programming 37: 37–65.
Share
Print

Authors

+ Gibbons, J More by this author

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

Journal:: Science of Computer Programming More from this journal
Volume:: 37
Pages:: 37-65
Publication date:: 2000-01-01

UUID:: uuid:1b9670d6-5edf-4679-9277-9956103d8f7e
Local pid:: cs:2366
Deposit date:: 2015-03-12

Terms of use

Copyright date:: 2000

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