Semigroups with if-then-else and halting programs

The "if–then–else" construction is one of the most elementary programming commands, and its abstract laws have been widely studied, starting with McCarthy. Possibly, the most obvious extension of this is to include the operation of composition of programs, which gives a semigroup of functions (total, partial, or possibly general binary relations) that can be recombined using if–then–else. We show that this particular extension admits no finite complete axiomatization and instead focus on the case where composition of functions with predicates is also allowed (and we argue there is good reason to take this approach). In the case of total functions — modeling halting programs — we give a complete axiomatization for the theory in terms of a finite system of equations. We obtain a similar result when an operation of equality test and/or fixed point test is included

bohózat 3 felvonásban - írta Herczeg Ferencz - rendező Békés Gyula

Városi Színház. Debreczen, csütörtök, 1907.évi deczember hó 19 -én.Debreceni Egyetem Egyetemi és Nemzeti Könyvtá

operette 3 felvonásban - írták Leon Viktor és Stein Leó - zenéjét szerzette Lehár Ferencz - fordította Mérei Adolf - rendező Polgár S - karnagy Fekete Oszkár

Városi Színház. Debreczen, kedd, 1907.évi márczius hó 19 -én Szalay Gyula búcsufelléptével.Debreceni Egyetem Egyetemi és Nemzeti Könyvtá

Minutes from the March 19, 1907 meeting of the University of Montana faculty

Meeting minutes from the March 19, 1907 meeting of the University of Montana faculty

Kenyon Collegian - April 19, 1907

https://digital.kenyon.edu/collegian/2449/thumbnail.jp

Albuquerque Citizen, 11-19-1907

https://digitalrepository.unm.edu/abq_citizen_news/3609/thumbnail.jp

Alamogordo News, 10-19-1907

https://digitalrepository.unm.edu/alamogordo_news/1200/thumbnail.jp