Programs, Computations and Temporal Features

Abstract Predicate Logic is a natural support to computing systems: computation and deduction are closely related. The way to describe proof strategies can clarify the theoretical soundness of programming. This description involves the clarification of the role of control statements. A semantic analysis of program statements can suggest useful restrictions to the interpreter. These find a natural representation in a temporal framework.

Authors

• Marco Colombetti
• Enrico Pagello

Keywords

No keywords are indexed for this paper.