Calendrical Calculations

Front Cover
Cambridge University Press, Dec 10, 2007 - Computers - 512 pages
A valuable resource for working programmers, as well as a fount of useful algorithmic tools for computer scientists, this new edition of the popular calendars book expands the treatment of the previous edition to new calendar variants: generic cyclical calendars and astronomical lunar calendars as well as the Korean, Vietnamese, Aztec, and Tibetan calendars. 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 are available on the Web.
 

Contents

4The Coptic and Ethiopic Calendars
73
5The ISO Calendar
79
7The Hebrew Calendar
89
8The Ecclesiastical Calendars
113
9The Old Hindu Calendars
123
The Mayan Calendars
137
The Balinese Pawukon Calendar
153
Generic Cyclical Calendars
163

The Ecclesiastical Calendars
385
The Old Hindu Calendars
386
The Mayan Calendars
388
The Balinese Pawukon Calendar
392
Time and Astronomy
395
The Persian Calendar
411
The BahaıCalendar
413
The French Revolutionary Calendar
416
The Chinese Calendar
417
The Modern Hindu Calendars
424
The Tibetan Calendar
435
Astronomical Lunar Calendars
437
Reference
439
Sample Data
441
References
447
3The Julian Calendar
63
Time and Astronomy
171
The Persian Calendar
217
The Bahaı Calendar
229
The French Revolutionary Calendar
239
The Chinese Calendar
247
The Modern Hindu Calendars
275
The Tibetan Calendar
315
Astronomical Lunar Calendars
325
Coda
333
Index
449
APPENDICES
iii
List of Frontispieces page
xii
Preface
xix
AFunction Parameter and Constant Types 337
xxi
Credits
xxvii
Copyright

Other editions - View all

Common terms and phrases

About the author (2007)

In addition to his expertise on calendars, Nachum Dershowitz is a leading figure in software verification in general, and termination of programs in particular; he is an international authority on equational inference and term-rewriting. Other research interests of his include program semantics and combinatorial enumeration. Dershowitz has authored or co-authored over one hundred 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. He was born in 1951 and his graduate degrees in Applied Mathematics are from the Weizmann Institute in Israel. He is currently a Professor of Computer Science at Tel-Aviv University.

Edward M. Reingold was born in Chicago, Illinois in 1945. He has an undergraduate degree in Mathematics from Illinois Institute of Technology and a Ph.D. in Computer Science from Cornell University. Reingold has been at the University of Illinois at Urbana-Champaign since 1970; he now a Professor of Computer Science there. 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 1995, Reingold has authored or co-authored over fifty research papers and nine books; his papers on backtrack search, generation of combinations, weight-balanced binary trees, and drawing of trees and graphs are considered classics. He has won awards for his undergraduate and graduate teaching. Reingold is intensely interested in calendars and their computer implementation: in addition to Calendrical Tabulations and Calendrical Calculations, he is the author and maintainer of the calendar/diary part of GNU Emacs.

Bibliographic information