On procedures as open subroutines. II

DOI10.1007/BF00288636zbMath0304.68016MaRDI QIDQ1216944

Hans Langmaack

Publication date: 1974

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

Mathematics Subject Classification ID

68N01: General topics in the theory of software

Related Items

Tree-stack automata, Zur Elimination von Prozedurschachtelungen, Expressive power of typed and type-free programming languages, The formal termination problem for programs with finite ALGOL 68-modes, The IO- and OI-hierarchies, On termination problems for finitely interpreted ALGOL-like programs, Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs, On the complexity of some problems concerning the use of procedures. II, On the expressive power of finitely typed and universally polymorphic recursive procedures, Correctness of parallel programs: The Church-Rosser approach

Uses Software

• ALGOL 68
• ALGOL 60

Cites Work

• Unnamed Item
• Report on the algorithmic language ALGOL 68
• On correct procedure parameter transmission in higher programming languages
• \(\lambda\)-definability and recursiveness
• Regular canonical systems
• Correspondence between ALGOL 60 and Church's Lambda-notation
• Stack automata and compiling
• Indexed Grammars—An Extension of Context-Free Grammars
• Mappings and grammars on trees