Calendrical calculations, II: Three historical calendars

Reingold, Edward M.; Dershowitz, Nachum; Clamen, Stewart M.

doi:10.1002/spe.4380230404

Cited by 5 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Efficiency has not been considered critical, in part because input and output performance is ultimately limited to the latency of I/O devices, which can be orders of magnitude slower than CPU speeds. As we demonstrate empirically later in this paper, input of a Gregorian calendar date such as 'January 1, 1993' using a commercially available routine takes approximately 3 ms, whereas output is substantially faster at 0.12 ms (on a 12-MIPS machine), The large disparity between the speeds of input and output cited above is due to the fact that this particular commercial input routine dynamically allocates memory during execution, whereas the output routine does not. To display the resulting string on a screen at 9600 baud takes much longer, about 13 ms.…”

Section: Introductionmentioning

confidence: 72%

Efficient timestamp input and output

Dyreson

Snodgrass

1994

Softw Pract Exp

View full text Add to dashboard Cite

In this paper we provide efficient algorithms for converting between timestamp values that signify some number of seconds from an arbitrary origin, and character strings specifying Gregorian dates, such as 'January 1, 1993'. We give several algorithms that explore a range of time and space trade-offs. Unlike previous algorithms, those discussed here have a constant time cost over a greatly extended range of timestamp values. These algorithms are especially useful in operating systems and in database management systems.

show abstract

Section: Introductionmentioning

confidence: 72%

Efficient timestamp input and output

Dyreson

Snodgrass

1994

Softw Pract Exp

View full text Add to dashboard Cite

show abstract

“…For comparison, in a functional style it is more natural to de ne special functions for each calendar e.g., the pair absolute from gregorian and gregorian from absolute would de ne the Gregorian calendar. Dershowitz et al 3,7] have written such pairs of functions in Common Lisp for several recent and historical calendars. To write just two complex functions in Common Lisp and distinguishing several cases according to respective calendars inside them is technically feasible, but it would inevitably lead to functions several pages long, which contradicts any principle of a good programming style.…”

Section: Conversion Between Calendarsmentioning

confidence: 99%

“…The example is taken from the area of calendrical calculations. Several calendars, both recent and historical were described using the functional programming paradigm in Common Lisp by 3,7].…”

Section: Introductionmentioning

confidence: 99%

Representing calendrical algorithms and data in Prolog and Prolog III languages

Návrat

Bieliková

1995

SIGPLAN Not.

View full text Add to dashboard Cite

Abstract. The paper reports on a study to develop solutions for a chosen problem in two related, but di erent languages. Moreover, the languages re ect two related, but di erent programming paradigms: logic programing, and constraint logic programming, respectively. We use Prolog to describe calendars and their mutual conversions. Next, we use Prolog III to describe the same. We discuss suitability of both languages for this kind of task. Prolog III as a logic programming language with constraints allows writing a program which is both more general (i.e., covering a broader range of cases) and more abstract (i.e., expressed on a higher level of abstraction due to the use of constraints).

show abstract

The avatars of a package for calendars in ada

Gauthier

1995

Softw Pract Exp

View full text Add to dashboard Cite

This paper shows the evolution of components for calendars written in Ada, starting from a classic form and evolving by the effect of some choices of software engineering. The first choice is to specify separate components when they do not have to be coupled in only one. This choice transforms a onecomponent form into a three-component one. The second choice is to hide all entities that are not required by the modelling of the real world. This choice modifies many declarations into forms which are complex to specify but which introduce no additional complexity to the user.In addition to the development of this component for the current legal calendar, it is indicated how others can be defined and converted from any one to the other. The design of a deep automatic test is illustrated. Finally, the paper illustrates how the new features of Ada-95 can be used to specify these calendars in another form, but which is not essentially different from the Ada-83 text.

show abstract

Calendrical calculations, II: Three historical calendars

Abstract: Algorithmic presentations are given for three calendars of historical interest, the Mayan, French Revolutionary, and Old Hindu.

Cited by 5 publications

References 6 publications

Efficient timestamp input and output

Efficient timestamp input and output

Representing calendrical algorithms and data in Prolog and Prolog III languages

The avatars of a package for calendars in ada

Contact Info

Product

Resources

About