Compared to online-retailers, bricks-and-mortar stores have only limited possibilities to understand consumer preferences, their intentions, and their feedback. The first are able to evaluate clickstream data collected on their webpages alongside the actual purchase data to put together a comprehensive view on individual customers. Bricks-and-mortar stores on the other hand have to rely solely on the evaluation of scanner data collected at the point of sale. Thus, akin to the Event Horizon in physics, describing the boundary beyond which events are unobservable, we introduce the term Receipt Horizon to describe the natural boundary beyond which a retailing company is unable to observe the behavior of individual customers. In this demo paper we present our comprehensive approach on how bricks-and-mortar stores can go beyond the Receipt Horizon. We demonstrate how existing customer loyalty programs can be leveraged by an extensive mobile app, transferring proven ecommerce concepts to physical retailers and collecting numerous novel information about consumers.

There are many powerful techniques for automated termination analysis of term rewriting. However, up to now they have hardly been used for real programming languages. We present a new approach which permits the application of existing techniques from term rewriting to prove termination of most functions defined in Haskell programs. In particular, we show how termination techniques for ordinary rewriting can be used to handle those features of Haskell which are missing in term rewriting (e.g., lazy evaluation, polymorphic types, and higher-order functions). We implemented our results in the termination prover AProVE and successfully evaluated them on existing Haskell libraries.

Module paths are often used to specify the delays of cells in a Verilog cell library description, which define the propagation delay for an event from an input to an output. Specifying such paths manually is an error prone task; a forgotten path is interpreted as a zero delay, which can cause further flaws in the subsequent design steps. Moreover, one can specify superfluous module paths, i.e., module paths that can never occur in any practical run of the model and hence, make excessive restrictions on the subsequent design decision. This paper presents a method to check whether the given module paths are reflected in the functional implementation. Complementing this check, we also present a method to derive module paths from a functional description of a cell.

For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate the notion of productivity. This generalizes stream productivity. We develop a general technique to prove productivity based on proving context-sensitive termination, by which the power of present termination tools can be exploited. In order to treat cases where the approach does not apply directly, we develop transformations extending the power of the basic approach. We present a tool combining these ingredients that can prove productivity of a wide range of examples fully automatically.