Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
2Activity

Table Of Contents

0.3 Acknowledgements
1 Basic Theories
1.0.0 Axioms and Proof Rules
1.0.1 Expression and Proof Format
1.0.2 Monotonicity and Antimonotonicity
1.2 Character Theory
2 Basic Data Structures
2.3.0 Multidimensional Structures
End of Multidimensional Structures
3 Function Theory
3.0.0 Abbreviated Function Notations
End of Abbreviated Function Notations
3.0.1 Scope and Substitution
3.2 Function Fine Points optional
3.2.0 Function Inclusion and Equality optional
3.2.1 Higher-Order Functions optional
3.2.2 Function Composition optional
3.3 List as Function
3.4 Limits and Reals optional
4 Program Theory
4.0.0 Specification Notations
4.0.1 Specification Laws
4.0.2 Refinement
4.1 Program Development
4.1.0 Refinement Laws
4.1.1 List Summation
4.1.2 Binary Exponentiation
4.2.1 Recursive Time
4.2.2 Termination
4.2.3 Soundness and Completeness optional
4.2.6 Fast Exponentiation
4.2.7 Fibonacci Numbers
5.0.1 Variable Suspension
5.2 Control Structures
5.2.0 While Loop
5.2.1 Loop with Exit
5.2.2 Two-Dimensional Search
5.3 Time and Space Dependence
5.5.0 Result Expression
5.7 Probabilistic Programming optional
5.7.0 Random Number Generators
5.8 Functional Programming optional
5.8.0 Function Refinement
6 Recursive Definition
6.0 Recursive Data Definition
6.0.0 Construction and Induction
6.0.1 Least Fixed-Points
6.0.2 Recursive Data Construction
6.1 Recursive Program Definition
6.1.0 Recursive Program Construction
6.1.1 Loop Definition
7Theory Design and Implementation
7.0.0 Data-Stack Theory
7.0.5 Data-Tree Implementation
7.1 Program Theories
7.1.0 Program-Stack Theory
7.1.1 Program-Stack Implementation
7.1.2 Fancy Program-Stack Theory
End of Fancy Program-Stack Theory
7.1.3 Weak Program-Stack Theory
7.1.4 Program-Queue Theory
7.1.5 Program-Tree Theory
7.2 Data Transformation
7.2.0 Security Switch
7.2.3 Soundness and Completeness optional
8 Concurrency
8.0 Independent Composition
8.0.0 Laws of Independent Composition
End of Laws of Independent Composition
8.0.1 List Concurrency
8.1 Sequential to Parallel Transformation
8.1.1 Insertion Sort
8.1.2 Dining Philosophers
9 Interaction
9.0 Interactive Variables
9.0.0 Thermostat
9.1.0 Implementability
9.1.1 Input and Output
9.1.2 Communication Timing
9.1.6 Reaction Controller
9.1.7 Channel Declaration
10 Exercises
10.1 Basic Data Structures
10.2 Function Theory
10.4 Programming Language
10.5 Recursive Definition
10.6 Theory Design and Implementation
10.7 Concurrency
10.8 Interaction
11 Reference
11.0.1 Boolean Theory
11.0.3 String Theory
11.0.4 Function Theory
11.0.5 Program Theory
11.0.6 Programming Language
11.0.7 Recursive Definition
11.0.8 Theory Design and Implementation
11.2 Bibliography
11.4.7 Functions
11.4.10 Specifications and Programs
11.4.11 Substitution
11.4.12 Conditions
11.4.13 Refinement
0 of .
Results for:
No results containing your search query
P. 1
37997710 Hehner a Practical Theory of Programming 2004

37997710 Hehner a Practical Theory of Programming 2004

Ratings: (0)|Views: 34 |Likes:
Published by Kirahwata

More info:

Published by: Kirahwata on Nov 23, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/31/2012

pdf

text

original

You're Reading a Free Preview
Pages 5 to 70 are not shown in this preview.
You're Reading a Free Preview
Pages 75 to 107 are not shown in this preview.
You're Reading a Free Preview
Pages 112 to 146 are not shown in this preview.
You're Reading a Free Preview
Pages 151 to 154 are not shown in this preview.
You're Reading a Free Preview
Pages 159 to 242 are not shown in this preview.

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->