January 2014
Beginner
428 pages
14h 1m
English
CHAPTER 13
![]()
Strong Types for Describing Offers
You’ve already finished two of the main tasks in this book: implementing some data-mining algorithms for analyzing clients and their purchases and looking at several ways to save the information about purchases in a durable container. This chapter is the starting point of the last task: creating a domain-specific language (DSL) for expressing offers to be applied in the Time Machine Store. You will provide a set of combinators to create the offers, which are initially basic offers.
Not all offers expressible in this language will be valid. The interesting part is that you can use the type system to ...
Read now
Unlock full access