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...

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...

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...

Peter Kasurak. Canada’s Mechanized Infantry: The Evolution of a Combat Arm, 1920-2012. 251 pp., plus figs., bibl., index. Vancouver: UBC Press, 2020. $32.95 (paperback). ISBN 978-0-7748-6273-8. Also available in e-book formats. https://www.ubcpress.ca/canadas-mechanized-infantry. Un article de la revue Scientia Canadensis (Photography: Science, Technology and Practice) diffusée par plateforme É...

introduction: hematology section provides valuable information for diagnosis and treatment of patients to improve the health of them. in this regard hematology information system led to deliver produced information accurately and timely. present study aimed to analyze the situation of hematology information systems in hospital laboratories. methods: in this descriptive study, 13 hematology info...

Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap access and modification. Properties of separating conjunction and separating implication are mechanically verified and used to prove soundness and relative completeness of all three Hoare logics. The whole development, i...