LEADER 03801nam  22006135  450 
001 996465788303316
005 20200706045916.0
010   $a3-540-47846-9
024 7 $a10.1007/3-540-18253-5
035   $a(CKB)1000000000230662
035   $a(SSID)ssj0000322266
035   $a(PQKBManifestationID)11248298
035   $a(PQKBTitleCode)TC0000322266
035   $a(PQKBWorkID)10280981
035   $a(PQKB)10208730
035   $a(DE-He213)978-3-540-47846-1
035   $a(PPN)155218794
035   $a(EXLCZ)991000000000230662
100   $a20121227d1987      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 12$aA Connotational Theory of Program Structure$b[electronic resource] /$fby James S. Royer
205   $a1st ed. 1987.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1987.
215   $a1 online resource (VIII, 188 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v273
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-18253-5 
327   $aMotivations, 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.
330   $aThis 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v273
606   $aComputer logic
606   $aMathematical logic
606   $aProgramming languages (Electronic computers)
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037
606   $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005
615  0$aComputer logic.
615  0$aMathematical logic.
615  0$aProgramming languages (Electronic computers).
615 14$aLogics and Meanings of Programs.
615 24$aMathematical Logic and Formal Languages.
615 24$aProgramming Languages, Compilers, Interpreters.
615 24$aMathematical Logic and Foundations.
676   $a005.1015113
700   $aRoyer$b James S$4aut$4http://id.loc.gov/vocabulary/relators/aut$058673
906   $aBOOK
912   $a996465788303316
996   $aConnotational theory of program structure$9878326
997   $aUNISA