Skip to content
Register Sign in Wishlist

Calendrical Calculations
The Ultimate Edition

4th Edition

$129.00 (C)

  • Date Published: April 2018
  • availability: Available
  • format: Hardback
  • isbn: 9781107057623
Average user rating
(1 review)

$ 129.00 (C)

Add to cart Add to wishlist

Other available formats:
Paperback, eBook

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • An invaluable resource for working programmers, as well as a fount of useful algorithmic tools for computer scientists, astronomers, and other calendar enthusiasts, The Ultimate Edition updates and expands the previous edition to achieve more accurate results and present new calendar variants. The book now includes coverage of Unix dates, Italian time, the Akan, Icelandic, Saudi Arabian Umm al-Qura, and Babylonian calendars. There are also expanded treatments of the observational Islamic and Hebrew calendars and brief discussions of the Samaritan and Nepalese calendars. Several of the astronomical functions have been rewritten to produce more accurate results and to include calculations of moonrise and moonset. The authors frame the calendars of the world in a completely algorithmic form, allowing easy conversion among these calendars and the determination of secular and religious holidays. LISP code for all the algorithms is available in machine-readable form.

    • Has general appeal across computer science and beyond
    • Includes LISP code in machine-readable form for all the algorithms
    • Now includes Unix dates, Italian time, the Akan, Icelandic, Saudi Arabian Umm al-Qura, and Babylonian calendars and calculations of moonrise and moonset
    Read more

    Reviews & endorsements

    'It retains all the features that made the first edition … such a wonderful resource, while adding much new material … If you are at all interested in time and calendars, this book must find a place on your desk.' Victor J. Katz, Mathematical Reviews

    Customer reviews

    23rd Feb 2020 by AG5KA

    The third edition of this book helped me wrote a calendar program in C, for my clock project running on AVRs. The book was purchased almost 10 years ago from Amazon. Today, I'm lucky that I found the fourth edition. An eBook has been ordered. I hope to read, and to improve the programs again. If I go to Cambridge, I will buy a printed version while I take off the train.

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Edition: 4th Edition
    • Date Published: April 2018
    • format: Hardback
    • isbn: 9781107057623
    • length: 660 pages
    • dimensions: 241 x 161 x 32 mm
    • weight: 1.22kg
    • availability: Available
  • Table of Contents

    1. Calendar basics
    Part I. Arithmetical Calendars:
    2. The Gregorian calendar
    3. The Julian calendar
    4. The Coptic and Ethiopic calendars
    5. The ISO calendar
    6. The Icelandic calendar
    7. The Islamic calendar
    8. The Hebrew calendar
    9. The Ecclesiastical calendars
    10. The old Hindu calendars
    11. The Mayan calendars
    12. The Balinese Pawukon calendar
    13. Generic Cyclical calendars
    Part II. Astronomical Calendars:
    14. Time and astronomy
    15. The Persian calendar
    16. The Bahá'í calendar
    17. The French Revolutionary calendar
    18. Astronomical Lunar calendars
    19. The Chinese calendar
    20. The modern Hindu calendars
    21. The Tibetan calendar
    Part III. Appendices: A. Function, parameter, and constant types
    B. Cross references
    C. Sample data
    D. Lisp implementation.

  • Resources for

    Calendrical Calculations

    Edward M. Reingold, Nachum Dershowitz

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact

  • Authors

    Edward M. Reingold, Illinois Institute of Technology
    Edward M. Reingold is Professor of Computer Science at the Illinois Institute of Technology, where he also served as chair from 2000 to 2006. Prior to that, he was a faculty member in the Department of Computer Science at the University of Illinois, Urbana-Champaign for thirty years. His research interests are in theoretical computer science, especially the design and analysis of algorithms and data structures. A Fellow of the Association for Computing Machinery since 1996, Reingold has authored or coauthored more than seventy research papers and ten books; his papers on backtrack search, generation of combinations, weight-balanced binary trees, and drawing of trees and graphs are considered classics. Reingold has won awards for his undergraduate and graduate teaching, and is intensely interested in calendars and their computer implementation. He is the author of Calendrical Tabulations (with Nachum Dershowitz, Cambridge, 2002) and is the author and former maintainer of the calendar/diary part of GNU Emacs.

    Nachum Dershowitz, Tel-Aviv University
    Nachum Dershowitz is Professor of Computational Logic at Tel Aviv University. Beyond his expertise in calendars, he is a leading figure in software verification in general and termination of programs in particular, and is an international authority on equational inference and term rewriting. Other areas in which he has made major contributions include program semantics, analysis of historical manuscripts, and combinatorial enumeration. Dershowitz has authored or coauthored more than 100 research papers and several books and has held visiting positions at prominent institutions around the globe. He has won numerous awards for his research and teaching, including the Herbrand Award for Distinguished Contributions to Automated Reasoning (2011), and Test-of-Time awards for the Institute of Electrical and Electronics Engineers Symposium on Logic in Computer Science (2006), for the International Conference on Rewriting Techniques and Applications (2014), and for the International Conference on Automated Deduction (2015). He was elected to Academia Europaea in 2013.

Related Books

also by this author

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.