This paper introduces a benchmark problem library for mechanized math technologies including computer algebra and automated theorem proving. The library consists of pre-university math problems taken from exercise problem books, university entrance exams, and the International Mathematical Olympiads. It thus includes problems in various areas of pre-university math and with a variety of difficu...

We propose a thesis defending the following statement: The logical notions of polarity and focusing provide a foundation for dependently typed programming with domain-specific logics, with applications to certified software and mechanized metatheory.

a delphi study was conducted in three phases to identify the driving and inhibiting factors of the development of mechanized cultivation of rice in guilan province. after consultation with professors and researchers in related institutions, 30 experts from the agricultural organization of guilan province and its subsidiary offices as well as faculty members of agricultural research centers of g...

The nineteenth century witnessed far-reaching changes in the nature and organization of industrial production. Traditional non-mechanized establishments artisan shops were displaced by mechanized water or steam-driven plants and extensive division of labor increased the average size of firms (Chandler 1977; Sokoloff 1984). In these new mills and "factories", the centralized nature of motive pow...

This research project was one of a number concerned with mechanized information retrieval carried out at INSPEC and supported by grants from, originally, the Department of Education and Science's Office for Scientific and Technical Information (OSTI) and, later, the British Library Research and Development Department (BLRDD). The first project, in the period 1967-69, had investigated the perfor...

Automated reasoning of inductive theorems is considered important in program verification. To verify inductive theorems automatically, several implicit induction methods like the inductionless induction and the rewriting induction methods have been proposed. In studying inductive theorems on higher-order rewritings, we found that the class of the theorems shown by known implicit induction metho...

Concurrent higher-order imperative programming languages with continuations are very flexible and allow for the implementation of sophisticated programming patterns. For instance, researchers and practitioners have argued that the implementation of web servers can be simplified by using a programming pattern based on continuations. This programming pattern can, in particular, help simplify keep...