编程原本

译者序

前言

关于作者

第1章 基础................................ 1

1.1理念范畴:实体,类别,类...

译者序

前言

关于作者

第1章 基础................................ 1

1.1理念范畴:实体,类别,类属.................1

1.2值.....................................2

1.3对象....................................4

1.4过程....................................6

1.5规范类型.................................7

1.6规范过程.................................8

1.7概念....................................10

1.8总结....................................14

第2章 变换及其轨道........................ 15

2.1变换....................................15

2.2轨道....................................18

2.3碰撞点...................................21

2.4轨道规模的度量.............................27

2.5动作....................................28

2.6总结....................................29

第3章 可结合运算.......................... 31

3.1可结合性.................................31

3.2计算乘幂.................................32

3.3程序变换.................................35

3.4处理特殊情况的过程..........................40

3.5参数化算法................................43

3.6线性递归.................................44

3.7累积过程.................................47

3.8总结....................................48

第4章 线性序................................ 49

4.1关系的分类................................49

4.2全序和弱序................................51

4.3按序选取.................................52

4.4自然全序.................................62

4.5派生过程组................................63

4.6按序选取过程的扩展..........................63

4.7总结....................................64

第5章 有序代数结........................... 65

5.1基本代数结构..............................65

5.2有序代数结构..............................70

5.3求余....................................72

5.4最大公因子................................76

5.5广义gcd..................................79

5.6Steingcd.................................81

5.7商.....................................82

5.8负量的商和余数.............................84

5.9概念及其模型..............................87

5.10计算机整数类型.............................88

5.11结论....................................89

第6章 迭代器.............................. 91

6.1可读性...................................91

6.2迭代器...................................92

6.3范围....................................94

6.4可读范围.................................97

6.5递增的范围................................106

6.6前向迭代器................................108

6.7索引迭代器................................113

6.8双向迭代器................................114

6.9随机访问迭代器.............................115

6.10总结....................................117

第7章坐标结构.............................. 119

7.1二叉坐标.................................119

7.2双向二叉坐标..............................123

7.3坐标结构.................................129

7.4同构,等价和有序............................129

7.5总结....................................137

第8章 后继可变的坐标....................... 139

8.1链接迭代器................................139

8.2链接重整.................................140

8.3链接重整的应用.............................147

8.4链接的二叉坐标.............................151

8.5结论....................................155

第9章拷贝.................................. 157

9.1可写性...................................157

9.2基于位置的拷贝.............................159

9.3基于谓词的拷贝.............................166

9.4范围的交换................................174

9.5总结....................................178

第10章 重整............................... 179

10.1置换....................................179

10.2重整....................................182

10.3 反转算法.................................184

10.4 轮换算法.................................188

10.5 算法选择.................................196

10.6 总结....................................200

第11章 划分和归并.......................... 201

11.1划分....................................201

11.2平衡的归约................................207

11.3归并....................................212

11.4总结....................................218

第12章 复合对象........................... 219

12.1简单复合对象..............................219

12.2动态序列.................................227

12.3基础类型.................................233

12.4总结....................................236

跋......................................... 237

附录A 数学表示............................ 241

附录B 程序设计语言........................ 243

参考文献................................... 253

索引....................................... 257