Abstract
When implementing a process automation, structured programming suggests that each logically independent algorithm corresponds to an independent section of the program, which is given a name, particularly when the algorithm requires execution at several points in the complete program, with perhaps only a change in its arguments (parameters). The execution of such a program section is initiated by calling it by name and providing it with any actual parameters required.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1982 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig
About this chapter
Cite this chapter
Werum, W., Windauer, H. (1982). Procedures. In: Introduction to PEARL. Programm Angewandte Informatik. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-85763-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-322-85763-7_5
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-528-03590-7
Online ISBN: 978-3-322-85763-7
eBook Packages: Springer Book Archive