Sweets

Sweets

Book - 2002
Average Rating:
Rate this:

A journey into the heart of sweetness.

Humans are all, secretly or openly, obsessed with sweet things-and we always have been. The Aztecs mixed chocolate with blood in sweet libations to their gods; Saladin entertained Richard the Lionheart with exotic sherbets and sugared jellies; Victorian sweets magnates built the towns of Bournville and Hersheyville from fortunes made through successful candies; and today the manufacture of sweets is shrouded in a level of secrecy that would make Willy Wonka proud.

In Sweets , Tim Richardson takes us on a magical confectionery tour through time and space, letting his personal passion fuel the narrative of candy's rich and unusual history. Beginning with a description of the biology of sweetness itself, Richardson navigates the ancient history of sweets, the incredible range and diversity of candies around the world, the bizarre figures and practices of the confectionery industry, and the connection between sweets and sex. He goes on to explore the role of sweets in myth and folklore, and finally, a personal philosophical justification for continual sweet-eating based on the writings of Epicurus.

A delicious blend of anecdote, history, and investigative reporting, Sweets is the perfect gift for everyone with a sweet tooth.

Publisher: New York : Bloomsbury 2002.
Edition: 1st U.S. ed. --
ISBN: 9781582342290
1582342296
Branch Call Number: 641.86 Ric
Characteristics: vii, 392 p. : col. ill. --
Alternative Title: A history of candy

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age Suitability

Add Age Suitability

There are no age suitabilities for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Browse by Call Number

Subject Headings

  Loading...

Find it at APL

  Loading...
[]
[]
To Top