The formal termination problem for programs with finite ALGOL 68-modes

DOI10.1016/0020-0190(79)90058-9zbMath0421.68018OpenAlexW1997660692MaRDI QIDQ1133312

Hans Langmaack, Franz Wagner, Wolfram-M. Lippe

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90058-9

zbMATH Keywords

interpreterfinite ALGOL 68-modesformal termination problemmonadic programrun time systemstack systemstandard procedure

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items

On termination problems for finitely interpreted ALGOL-like programs, On the complexity of some problems concerning the use of procedures. II, Wythoff games, continued fractions, cedar trees and Fibonacci searches, Correctness of programs with Pascal-like procedures without global variables

Uses Software

• ALGOL 68
• ALGOL 60

Cites Work

• Pascal. User manual and report. 2nd ed
• On procedures as open subroutines. II
• Revised report on the algorithmic language ALGOL 68
• On correct procedure parameter transmission in higher programming languages
• Initial Algebra Semantics and Continuous Algebras
• Stack automata and compiling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item