Conference item icon

Conference item

Understanding Idiomatic Traversals Backwards and Forwards

Abstract:

We present new ways of reasoning about a particular class of effectful Haskell programs, namely those expressed as idiomatic traversals. Starting out with a specific problem about labelling and unlabelling binary trees, we extract a general inversion law, applicable to any monad, relating a traversal over the elements of an arbitrary traversable type to a traversal that goes in the opposite direction. This law can be invoked to show that, in a suitable sense, unlabelling is the inverse of lab...

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Host title:
Haskell Symposium
Publication date:
2013-09-01
UUID:
uuid:09b93206-8dda-49f9-bdec-9ee409a191f6
Local pid:
cs:7024
Deposit date:
2015-03-04

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