# Zipper (data structure)

__: Technique of representing an aggregate data structure__

**Short description**A **zipper** is a technique of representing an aggregate data structure so that it is convenient for writing programs that traverse the structure arbitrarily and update its contents, especially in purely functional programming languages. The zipper was described by Gérard Huet in 1997.^{[1]} It includes and generalizes the gap buffer technique sometimes used with arrays.

The zipper technique is general in the sense that it can be adapted to lists, trees, and other recursively defined data structures. Such modified data structures are usually referred to as "a tree with zipper" or "a list with zipper" to emphasize that the structure is conceptually a tree or list, while the zipper is a detail of the implementation.

A layperson's explanation for a tree with zipper would be an ordinary computer filesystem with operations to go to parent (often `cd ..`

), and the possibility to go downwards (`cd subdirectory`

). The zipper is the pointer to the current path. Behind the scenes the zippers are efficient when making (functional) changes to a data structure, where a new, slightly changed, data structure is returned from an edit operation (instead of making a change in the current data structure).

## Example: Bidirectional list traversal

Many common data structures in computer science can be expressed as the structure generated by a few primitive constructor operations or observer operations. These include the structure of finite lists, which can be generated by two operations:

`Empty`

constructs an empty list,`Cons(x, L)`

constructs a list by prepending or concatenating value`x`

in front of list`L`

.

A list such as `[1, 2, 3]`

is therefore the declaration `Cons(1, Cons(2, Cons(3, Empty)))`

. It is possible to describe the location in such a list as the number of steps from the front of the list to the target location. More formally, a location in the list is the number of `Cons`

operations required to reconstruct the whole list from that particular location. For example, in `Cons(1, Cons(2, Cons( X, Cons(4, Empty))))`

a `Cons(2, L)`

and a `Cons(1, L)`

operation would be required to reconstruct the list relative to position X otherwise known as `Cons( X, Cons(4, Empty))`

. This recording together with the location is called a zipped representation of the list or a list-zipper.

To be clear, a location in the list is not just the number of `Cons`

operations, but also all of the other information about those `Cons`

; in this case, the values that must be reconnected. Here, these values may be conveniently represented in a separate list in the order of application from the target location. Specifically, from the context of "3" in the list `[1, 2, 3, 4]`

, a recording (commonly referred to as a 'path') could be represented as `[2, 1]`

where `Cons(2, L)`

is applied followed by `(Cons 1, L)`

to reconstitute the original list starting from `[3, 4]`

.

A list-zipper always represents the entire data structure. However, this information is from the perspective of a specific location within that data structure. Consequently, a list-zipper is a pair consisting of both the location as a context or starting point, and a recording or path that permits reconstruction from that starting location. In particular, the list-zipper of `[1, 2, 3, 4]`

at the location of "3" may be represented as `([2, 1], [3, 4])`

. Now, if "3" is changed to "10", then the list-zipper becomes `([2, 1], [10, 4])`

. The list may then be efficiently reconstructed: `[1, 2, 10, 4]`

or other locations traversed to.

With the list represented this way, it is easy to define relatively efficient operations on immutable data structures such as Lists and Trees at arbitrary locations. In particular, applying the zipper transform to a tree makes it easy to insert or remove values at any particular location in the tree.

## Contexts and differentiation

The type of a zipper's contexts can be constructed via a transformation of the original type that is closely related to the derivative of calculus through decategorification. The recursive types that zippers are formed from can be viewed as the least fixed point of a unary type constructor of kind [math]\displaystyle{ * \rightarrow * }[/math]. For example, with a higher-order type constructor [math]\displaystyle{ \text{lfp} : (* \rightarrow *) \rightarrow * }[/math] that constructs the least fixed point of its argument, an unlabeled binary tree can be represented as [math]\displaystyle{ \text{lfp}(T \mapsto T^2 + 1) }[/math] and an unlabeled list may take the form [math]\displaystyle{ \text{lfp}(T \mapsto T + 1) }[/math]. Here, the notation of exponentiation, multiplication, and addition correspond to function types, product types, and sum types respectively, whilst the natural numbers label the finite types; in this way, the type constructors resemble polynomial functions in [math]\displaystyle{ \mathbb{N} \rightarrow \mathbb{N} }[/math].^{[2]}

The derivative of a type constructor can therefore be formed through this syntactic analogy: for the example of an unlabeled ternary tree, the derivative of its type constructor [math]\displaystyle{ (T \mapsto T^3 + 1)' }[/math] would be equivalent to [math]\displaystyle{ T \mapsto 3 \times T^2 }[/math], analogously to the use of the sum and power rules in differential calculus. The type of the contexts of a zipper over an original type [math]\displaystyle{ \text{lfp}(f) }[/math] is equivalent to the derivative of the type constructor applied to the original type, [math]\displaystyle{ f'(\text{lfp}(f)) }[/math].^{[3]}

For illustration, consider the recursive data structure of a binary tree with nodes that are either sentinel nodes of type 1 or contain a value of type A:

The partial derivative of the type constructor can be computed to be

Thus, the type of the zipper's contexts is

As such, we find that the context of each non-sentinel child node in the labelled binary tree is a triple consisting of

- a boolean value of type 2, expressing whether the current node is the left or right child of its parent node;
- a value of type A, the label of the current node's parent; and
- the node's sibling of type BTree, the subtree contained by the other branch of the current node's parent.

In general, a zipper for a tree of type [math]\displaystyle{ \text{lfp}(f) }[/math] consists of two parts: a list of contexts of type [math]\displaystyle{ f'(\text{lfp}(f)) }[/math] of the current node and each of its ancestors up until the root node, and the value of type [math]\displaystyle{ \text{lfp}(f) }[/math] that the current node contains.

## Uses

The zipper is often used where there is some concept of focus or of moving around in some set of data, since its semantics reflect that of moving around but in a functional non-destructive manner.

The zipper has been used in

- Xmonad, to manage focus and placement of windows
- Huet's papers cover a structural editor
^{[4]}based on zippers and a theorem prover - A filesystem (ZipperFS) written in Haskell offering "...transactional semantics; undo of any file and directory operation; snapshots; statically guaranteed the strongest, repeatable read, isolation mode for clients; pervasive copy-on-write for files and directories; built-in traversal facility; and just the right behavior for cyclic directory references."
^{[5]} - Clojure has extensive support for zippers.
^{[6]}

## Alternatives and extensions

### Direct modification

In a non-purely-functional programming language, it may be more convenient to simply traverse the original data structure and modify it directly (perhaps after deep cloning it, to avoid affecting other code that might hold a reference to it).

### Generic zipper

The generic zipper^{[7]}^{[8]}^{[9]} is a technique to achieve the same goal as the conventional zipper by capturing the state of the traversal in a continuation while visiting each node. (The Haskell code given in the reference uses generic programming to generate a traversal function for any data structure, but this is optional – any suitable traversal function can be used.)

However, the generic zipper involves inversion of control, so some uses of it require a state machine (or equivalent) to keep track of what to do next.

## References

- ↑ Huet 1997
- ↑ "Une théorie combinatoire des séries formelles".
*Advances in Mathematics***42**(1): 1–82. October 1981. doi:10.1016/0001-8708(81)90052-9. - ↑ McBride, Conor (2001), "The Derivative of a Regular Type is its Type of One-Hole Contexts"
- ↑ Hinze, Ralf; Jeuring, Johan (2001). "Functional Pearl: Weaving a web".
*Journal of Functional Programming***11**(6): 681–689. doi:10.1017/S0956796801004129. ISSN 0956-7968. - ↑ Generic Zipper: the context of a traversal
- ↑ jafingerhut (2010-10-22). "clojure.zip/zipper". ClojureDocs. http://clojuredocs.org/clojure_core/clojure.zip/zipper.
- ↑ Chung-chieh Shan, Oleg Kiselyov (17 August 2008). "From walking to zipping, part 1". http://conway.rutgers.edu/~ccshan/wiki/blog/posts/WalkZip1/.
- ↑ Chung-chieh Shan, Oleg Kiselyov (17 August 2008). "From walking to zipping, part 2". http://conway.rutgers.edu/~ccshan/wiki/blog/posts/WalkZip2/.
- ↑ Chung-chieh Shan, Oleg Kiselyov (17 August 2008). "From walking to zipping, part 3". http://conway.rutgers.edu/~ccshan/wiki/blog/posts/WalkZip3/.

## Further reading

- Huet, Gerard (September 1997). "The Zipper".
*Journal of Functional Programming***7**(5): 549–554. doi:10.1017/s0956796897002864. http://www.st.cs.uni-sb.de/edu/seminare/2005/advanced-fp/docs/huet-zipper.pdf. - Hinze, Ralf; Jeuring, Johan; Löh, Andres (May 2004). "Type-indexed data types".
*Science of Computer Programming***51**(1–2): 117–151. doi:10.1016/j.scico.2003.07.001.

## External links

- Zipper
- Theseus and the Zipper
- "Roll Your Own Window Manager: Tracking Focus with a Zipper"
- Definition
- "An Applicative Control-Flow Graph Based on Huet's Zipper"
- Infinitesimal Types

Original source: https://en.wikipedia.org/wiki/Zipper (data structure).
Read more |