000 03208nam a22005535i 4500
001 978-3-540-47846-1
003 DE-He213
005 20160624102027.0
007 cr nn 008mamaa
008 121227s1987 gw | s |||| 0|eng d
020 _a9783540478461
_9978-3-540-47846-1
024 7 _a10.1007/3-540-18253-5
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
100 1 _aRoyer, James S.
_eauthor.
245 1 2 _aA Connotational Theory of Program Structure
_h[electronic resource] /
_cby James S. Royer.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1987.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1987.
300 _aVIII, 188 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v273
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aLogic design.
650 0 _aLogic, Symbolic and mathematical.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aMathematical Logic and Foundations.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540182535
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v273
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-18253-5
942 _2EBK6211
_cEBK
999 _c35505
_d35505