{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":23,"n_cols":5,"rows_kept":23,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[16,2,16,3],[17,2,17,3],[20,2,20,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465788303316"]
[null,null,"Autore",null,"Royer James S"]
[null,null,"Titolo",null,"A Connotational Theory of Program Structure [[electronic resource] /] / by James S. Royer"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987"]
[null,null,"ISBN",null,"3-540-47846-9"]
[null,null,"Edizione",null,"[1st ed. 1987.]"]
[null,null,"Descrizione fisica",null,"1 online resource (VIII, 188 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 273"]
[null,null,"Disciplina",null,"005.1015113"]
[null,null,"Soggetti",null,"Computer logic"]
[{"$nulls":4},"Mathematical logic"]
[{"$nulls":4},"Programming languages (Electronic computers)"]
[{"$nulls":4},"Logics and Meanings of Programs"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$nulls":4},"Programming Languages, Compilers, Interpreters"]
[{"$nulls":4},"Mathematical Logic and Foundations"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"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."]
[null,null,null,"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 "]
[{"$nulls":4},"characterizations are presented and two compactness results for such characterizations are shown."]