Buch, Englisch, Band 273, 188 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 306 g
Buch, Englisch, Band 273, 188 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 306 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-18253-5
Verlag: Springer Berlin Heidelberg
This book presents developments of a language independent theory of program structure. The theory features a simple, natural notion of control structure which is much broader than in other theories of programming languages such as denotational semantics and program schemes. This notion permits treatment of control structures which involve not only the denotation of programs (i.e., their input/output behavior), but also their structure, size, run times, etc. The theory also treats the relation of control structure and complexity properties of programming languages. The book focuses on expressive interdependencies of control structures (which control structures can be expressed by which others). A general method of proving control structures expressively independent is developed. The book also considers characterizations of the expressive power of general purpose programming languages in terms of control structures. Several new characterizations are presented and two compactness results for such characterizations are shown.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
- Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
Weitere Infos & Material
Motivations, background, and basic definitions.- Effective numberings, completions, and control structures.- Some special effective numberings.- Characterizations of acceptability.- Independence of control structures.- General programming properties of effective numberings of subrecursive classes.
