Sage Journals: Discover world-class research

Abstract

The fact that for every formula describing properties of programs with recursive functions there exists an equivalent while-formula with stacks is proved in a constructive way. This implies the possibility of using the algorithmic theory of stacks to prove the properties of ALGOL-like programs. The normal forms for such programs are also defined.

Keywords

algorithmic logic algorithmic theory block-structured program interpretation of theories normal forms for programs recursive functions relational system translation

Get full access to this article

View all access options for this article.

On an Application of Algorithmic Theory of Stacks

Abstract

Keywords

Get full access to this article