On correct procedure parameter transmission in higher programming languages

zbMath0263.68012MaRDI QIDQ2561483

Hans Langmaack

Publication date: 1973

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items

Low cost environment changing in a shallow binding system ⋮ A polynomial determination of the most-recent property in Pascal-like programs ⋮ The formal termination problem for programs with finite ALGOL 68-modes ⋮ Polynomial recursion analysis in pascal like programs ⋮ Complexity of proving program correctness ⋮ On termination problems for finitely interpreted ALGOL-like programs ⋮ Tree-stack automata ⋮ On the complexity of some problems concerning the use of procedures. II ⋮ On procedures as open subroutines. II ⋮ Zur Elimination von Prozedurschachtelungen ⋮ Wythoff games, continued fractions, cedar trees and Fibonacci searches ⋮ Correctness of programs with Pascal-like procedures without global variables ⋮ Pseudo-recursive procedures