Cantitate/Preț
Produs

A Connotational Theory of Program Structure: Lecture Notes in Computer Science, cartea 273

Autor James S. Royer
en Limba Engleză Paperback – 26 aug 1987
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31026 lei

Preț vechi: 38783 lei
-20% Nou

Puncte Express: 465

Preț estimativ în valută:
5942 6430$ 4953£

Carte tipărită la comandă

Livrare economică 09-23 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540182535
ISBN-10: 3540182535
Pagini: 196
Ilustrații: VIII, 188 p.
Dimensiuni: 155 x 235 x 10 mm
Greutate: 0.28 kg
Ediția:1987
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.