Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Royer J.S. — A Connotational Theory of Program Structure
Royer J.S. — A Connotational Theory of Program Structure



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: A Connotational Theory of Program Structure

Автор: Royer J.S.

Аннотация:

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.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Издание: 1

Год издания: 1987

Количество страниц: 186

Добавлена в каталог: 06.02.2011

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
$C-effective_1$ operator      173
$C-effective_2$ operator      173
$Effective_1$ operator      167
$Effective_2$ operator      167
$reconstitutable KRT      65
$Right-composition_{\alpha}$      26
$s-1-1_{\alpha}$      79
$Store_n$      80
$\beta -dense$ immune      155
$\psi$-program      15
1-degree      12
1-enumeration      31
1-equivalent      12
1-reducible      12
1-Rogers class      31
1-Rogers reduction      31
Acceptable numbering      16
Augmented enumeration      99
Augmented enumeration of control structures      100
Augmented enumeration, effective      99
Base numbering      55
Base programs      55
Blum complexity measure      40
Blum Slow Down Theorem      11
Bounded existential search      33
Bounded maximalization      33
Bounded minimalization      33
C-downward inheritance property      97
C-effective functional      173
C-index set      173
Canonical indexing of finite sets      10
Characterization of a set of control structures      23
Characterization of acceptability      23
Closure of a class under a set of operators      32
Coded KRT      63
Cohesive      11
Compatible      53 66
Complete and non-degenerate      52 109
Completion      53
Completion of a finite base      66
Completion with respect to infinitely many control structures      109
composition      19
Compositional closure      32
Conditional      19
Conditional definition      33
Confined control structure      96
Continuous functional      169
Control structure      18
Control structure, C-effective instance      32
Control structure, effective instance      18
Control structure, instance      18
Control structure, schema      18
Control structure, with MR predicate      24
Correspondence of functionals      169
Correspondence of operators      167
Course of values recursion      144
Delay      22
Dense immune      11
Determines an acceptable numbering      45
Dinitely founded characterization of acceptability      95
Discrete class      161
Double KRT      22
Effective functional      169
Effective numbering      15
Effective operation      40
Effectively discrete class      161
Effectively one-one translates      31
Effectively segmented      165
Effectively translates      15
Elementary closure      33
EN      15
Entails      23
Entails acceptability      23
Enumeration operator      13
Extensional control scheme      56
Extensional control structure      56
Extensional dependence      93
Extensional in certain arguments      56
f-coded KRT      63
f-reconstitutable KRT      65
Finitary control structure      110
Finitary recursive operator      110
FPRT      27
Friedberg numbering      31
Functional      169
Height of a program      56 109
Hyperimmune      11
Hypersimple      11
Immune      11
Independence of one set of control structures from another      25
Infinite padding      20
Instance of a control structure      18
Instance of a control structure, effective      18
Isolated point      161
Isolated set      11
Iteration extension      33
KRT      21
Least fixed point of a set of functions      51
Left-composition      20 26
Length-loop      148
Limit point      161
Limiting recursive      14
Loop      28
m-degree      11
m-equivalent      11
Many-one reducible      11
Minimalization      28
mono s-1-1      34
MR predicate      24
Myhill-Shepherdson property      40
Non-degenerate      52 108
Numbering      15
One-one      29
Operator on C      167
padding      20
pair      28
Pairing function      10
Partial conditional      26
Partial limiting recursive      14
PKRT      27
Primitive recursion      21
Primitive recursive operator      13
Programmable numbering      16
r.e. $\psi$-sequence      40
r.e. sequence      14
Realizes      29
Recursive extensional control structure      57
Recursive Functional      169
Recursive isomorphism of numberings      16
Recursive Operator      13
Recursive operator on C      167
Recwhile      28
REPEAT      28
Restricted closure      94
Rice, Shapiro property      40
Rogers class      30
Rogers equivalent      16
Rogers reduction      15
s-1-1      19
s-m-n      26
Selects      129 136 138
SIMPLE      11
Standard effective enumeration of recursive operators      13
Standard EN of PrimRec      69
Strange      92
Stretching      111
Strong finitely founded characterization of acceptability      95
Total effective functional in $\psi$      169
Total FPRT      27
Trivial predicate      34
while      20
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2020
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте