… point-free combinators can be lifted to lenses with suitable backward semantics, allowing us
to use the point-free style … We also demonstrate how to define generic lenses over arbitrary …

… of point-free programs [6, 9], extending it to support lenses. … of a lens, since they are also
defined in the pointfree style: we … expressivity of our point-free lens language. For example, all …

… of primitive delta lens combinators and redefine the point-free lens combinators from [PC10]
as delta lenses over shapes. Section 5 studies the construction of recursive delta lenses and …

… into generic point-free programs than can be optimized to non-generic point-free functions
… To lift the resulting functions into lenses, we check if their point-free expressions are defined …

… The value-level semantics of these combinators is defined according to our point-free lens …
point-free programs with our algebraic lens laws, to enable the automatic optimization of lens …

… Recent work has been developed to specify these lenses using functional point-free (PF) …
to well-behaved lenses. This approach enables easy equational calculation with lenses and …

… A lens point-free design An application domain (Lenses over trees) data c … Goal how to
compute the correct restrictions on the backward transformation and the lens domains? …

… lenses to form more complex ones. Lens combinators preserve the bidirectionality of lenses
and are expressive; but they compel programmers to a specialised point-free style—ie, no …

… Sequential composition and skip, combined with the already defined predicate operators,
provide us with the facilities for describing point-free while programs [2], which we illustrate by …

… of primitive delta lens combinators and redefine the point-free lens combinators from [PC10]
as delta lenses over shapes. Section 5 studies the construction of recursive delta lenses and …