On correct procedure parameter transmission in higher programming languages

MaRDI QIDQ2561483zbMATHFDO

Authors Hans Langmaack

Publication date 1973

Published in Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cited in

(13)

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

This page was built for publication: On correct procedure parameter transmission in higher programming languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2561483)