1.

Record Nr.

UNISA996465788303316

Autore

Royer James S

Titolo

A Connotational Theory of Program Structure [[electronic resource] /] / by James S. Royer

Pubbl/distr/stampa

Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987

ISBN

3-540-47846-9

Edizione

[1st ed. 1987.]

Descrizione fisica

1 online resource (VIII, 188 p.)

Collana

Lecture Notes in Computer Science, , 0302-9743 ; ; 273

Disciplina

005.1015113

Soggetti

Computer logic

Mathematical logic

Programming languages (Electronic computers)

Logics and Meanings of Programs

Mathematical Logic and Formal Languages

Programming Languages, Compilers, Interpreters

Mathematical Logic and Foundations

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di contenuto

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.

Sommario/riassunto

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.