Conference item icon

Conference item

Kan Extensions for Program Optimisation—Or: Art and Dan Explain an Old Trick

Abstract:

Many program optimisations involve transforming a program in direct style to an equivalent program in continuation-passing style. This paper investigates the theoretical underpinnings of this transformation in the categorical setting of monads. We argue that so-called absolute Kan Extensions underlie this program optimisation. It is known that every Kan extension gives rise to a monad, the codensity monad, and furthermore that every monad is isomorphic to a codensity monad. The end formula fo...

Expand abstract

Actions


Authors


Publisher:
Springer Berlin / Heidelberg
Host title:
11th International Conference on Mathematics of Program Construction (MPC '12)
Volume:
7342
Publication date:
2012-01-01
UUID:
uuid:f90fee56-d21d-406f-8982-d43cd94b289f
Local pid:
cs:8040
Deposit date:
2015-03-31

Terms of use


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