Computer Science – Programming Languages
Scientific paper
2012-02-14
EPTCS 76, 2012, pp. 40-49
Computer Science
Programming Languages
In Proceedings MSFP 2012, arXiv:1202.2407
Scientific paper
10.4204/EPTCS.76.5
Traversals of data structures are ubiquitous in programming. Consequently, it is important to be able to characterise those structures that are traversable and understand their algebraic properties. Traversable functors have been characterised by McBride and Paterson as those equipped with a distributive law over arbitrary applicative functors; however, laws that fully capture the intuition behind traversals are missing. This article is an attempt to remedy this situation by proposing laws for characterising traversals that capture the intuition behind them. To support our claims, we prove that finitary containers are traversable in our sense and argue that elements in a traversable structure are visited exactly once.
Jaskelioff Mauro
Rypacek Ondrej
No associations
LandOfFree
An Investigation of the Laws of Traversals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Investigation of the Laws of Traversals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Investigation of the Laws of Traversals will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-88571