An introduction to programming with specifications : a mathematical approach / by Ryszard Kubiak

By: Kubiak, RlyszardMaterial type: TextTextSeries: A.P.I.C. studies in data processing, no. 35Publication details: London : Academic Press, 1991cDescription: ix, 267 p. : ill. ; 24 cmISBN: 0124276202 (hbk)Subject(s): Computer programmingDDC classification: 005.12
Contents:
0- Introduction 1- Basic Mathematical Vocabulary 2- On Definitions & Specifications 3- Conditional Expressions 4- Logical Expressions 5- Recursive Function Definitions 6- Designing Recursive Definitions 7- More Complex Recursion 8- High-Order Data : Sequences 9- Our Main Tool : Induction 10- Proving Facts About Recursively Defined Functions 11- Tail Recursion 12- Iterative Algorithms 13- From Recursion to Iteration & Back 14- Partial & Total Correctness 15- How to Design Iterative Algorithms 16- Computer Programming Solution of Exercises
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Call number Status Date due Barcode Item holds
Books Books Namal Library
Computer Science
005.12 KUB-A 1991 1692 (Browse shelf (Opens below)) Available 1692
Total holds: 0
Browsing Namal Library shelves, Shelving location: Computer Science Close shelf browser (Hides shelf browser)
005.12 GAM-D 2012 2837 Design patterns : 005.12 GAM-D 2012 2838 Design patterns : 005.12 GOP-M 2011 4621 Magnifying object-oriented analysis and design 005.12 KUB-A 1991 1692 An introduction to programming with specifications : 005.12 POH-R 2011 1158 Requirements engineering : 005.12 RAT-S 1987 1617 Software engineering : 005.12 ROB-S 2000 1611 Simple program design :

Index included

0- Introduction
1- Basic Mathematical Vocabulary
2- On Definitions & Specifications
3- Conditional Expressions
4- Logical Expressions
5- Recursive Function Definitions
6- Designing Recursive Definitions
7- More Complex Recursion
8- High-Order Data : Sequences
9- Our Main Tool : Induction
10- Proving Facts About Recursively Defined Functions
11- Tail Recursion
12- Iterative Algorithms
13- From Recursion to Iteration & Back
14- Partial & Total Correctness
15- How to Design Iterative Algorithms
16- Computer Programming
Solution of Exercises

There are no comments on this title.

to post a comment.