On expressing control and data structures in predicate logic language ALGOL M
Alois Glanc · ACM SIGPLAN Notices · 1979
We define a procedural semantics for a many sorted predicate logic on many sorted models with generators. Then we express in Predicate Logic do forever, do until, do while, for thru, do unless, call, resume and demon control constructs. Data Structures can be represented using vectors (sequence of logic variables of the same sort.) This indicates that predicate logic can be a base of a high level language (ALGOL M) where programming can be as easy and efficient as in most other programming languages and whose syntax and semantics is simple and uniform. This language has systems programming like features, facilitating representation and utilization of knowledge in Artificial Intelligence Applications.