GHU Logo
The Great Heights University Library
Academic discovery, digital access, and research support

Effective Theories in Programming Practice/ (Record no. 942)

MARC details
000 -LEADER
fixed length control field 04000nam a2200481 i 4500
001 - CONTROL NUMBER
control field 9781450399746
003 - CONTROL NUMBER IDENTIFIER
control field ACM
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260609133907.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 230111s2023 nyu 001 0deng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 3568325
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781450399746
Qualifying information ebook
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781450399722
Qualifying information epub
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Canceled/invalid ISBN 9781450399739
Qualifying information hardcover
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
Canceled/invalid ISBN 9781450399715
Qualifying information paperback
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1145/3568325
Source of number or code doi
100 0# - MAIN ENTRY--PERSONAL NAME
Personal name Misra, Jayadev
Relator term author.
245 10 - TITLE STATEMENT
Title Effective Theories in Programming Practice/
Statement of responsibility, etc. Jayadev Misra.
250 ## - EDITION STATEMENT
Edition statement First Edition
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture [New York, NY, USA] :
Name of producer, publisher, distributor, manufacturer Association for Computing Machinery;
Date of production, publication, distribution, manufacture, or copyright notice [2022].
300 ## - PHYSICAL DESCRIPTION
Extent 1 PDF (xx, 542pages)
Other physical details LuaTEX
490 1# - SERIES STATEMENT
Series statement ACM books,
International Standard Serial Number 2374-6777 ;
Volume/sequential designation #47
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note Preface
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 1 Introduction -- 1.1 Motivation for This Book -- 1.2 Lessons from Programming Theory -- 1.3 Formalism: The Good, the Bad and the Ugly
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 2 Set Theory, Logic and Proofs -- 2.1 Set -- 2.2 Function -- 2.3 Relation -- 2.4 Order Relations: Totaland Partial -- 2.5 Propositional Logic -- 2.6 Predicate Calculus -- 2.7 Formal Proofs -- 2.8 Examples of Proof Construction -- 2.9 Exercises
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 3 Induction and Recursion -- 3.1 Introduction -- 3.2 Examples of Proof by Induction -- 3.3 Methodologies for Applying Induction -- 3.4 Advanced Examples -- 3.5 Noetherian or Well-founded Induction -- 3.6 Structural Induction -- 3.7 Exercises
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 4 Reasoning About Programs -- 4.1 Overview -- 4.2 Fundamental Ideas -- 4.3 Formal Treatment of Partial Correctness -- 4.4 A Modest Programming Language -- 4.5 Proof Rules -- 4.6 More on Invariant -- 4.7 Formal Treatment of Termination -- 4.8 Reasoning about Performance of Algorithms -- 4.9 Order of Functions -- 4.10 Recurrence Relations -- 4.11 Proving Programs in Practice -- 4.12 Exercises -- 4.A Appendix: Proof of Theorem -- 4.B Appendix: Termination in Chameleons Problem
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 5 Program Development -- 5.1 Binary Search -- 5.2 Saddleback Search -- 5.3 Dijkstra's Proof of the am-gm Inequality -- 5.4 Quicksort -- 5.5 Heapsort -- 5.6 Knuth-Morris-Pratt String-matching Algorithm -- 5.7 A Sieve Algorithm for Prime Numbers -- 5.8 Stable Matching -- 5.9 Heavy-hitters: A Streaming Algorithm -- 5.10 Exercises
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 6 Graph Algorithms -- 6.1 Introduction -- 6.2 Background -- 6.3 Specific Graph Structures -- 6.4 Combinatorial Applications of Graph Theory -- 6.5 Reachability in Graphs -- 6.6 Graph Traversal Algorithms -- 6.7 Connected Components of Graphs -- 6.8 Transitive Closure -- 6.9 Single Source Shortest Path -- 6.10 Minimum Spanning Tree -- 6.11 Maximum Flow -- 6.12 Goldberg-Tarjan Algorithm for Maximum Flow -- 6.13 Exercises -- 6.A Appendix: Proof of the Reachability Program -- 6.B Appendix: Depth-first Traversal
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 7 Recursive and Dynamic Programming -- 7.1 What is Recursive Programming -- 7.2 Programming Notation -- 7.3 Reasoning About Recursive Programs -- 7.4 Recursive Programming Methodology -- 7.5 Recursive Data Types -- 7.6 Dynamic Programming -- 7.7 Exercises -- 7.A Appendices
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note 8 Parallel Recursion -- 8.1 Parallelism and Recursion -- 8.2 Powerlist -- 8.3 Pointwise Function Application -- 8.4 Proofs -- 8.5 Advanced Examples Using Powerlists -- 8.6 Multi-dimensional Powerlist -- 8.7 Other Work on Powerlist -- 8.8 Exercises -- 8.A Appendices
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note Bibliography
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note Authors' Biographies
505 8# - FORMATTED CONTENTS NOTE
Formatted contents note Index
506 ## - RESTRICTIONS ON ACCESS NOTE
Terms governing access Abstract freely available; full-text restricted to subscribers or individual document purchasers.
530 ## - ADDITIONAL PHYSICAL FORM AVAILABLE NOTE
Additional physical form available note Also available in print.
538 ## - SYSTEM DETAILS NOTE
System details note Mode of access: World Wide Web
538 ## - SYSTEM DETAILS NOTE
System details note System requirements: Adobe Acrobat Reader
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Effective Theories in Programming Practice(Computer Science)
655 #0 - INDEX TERM--GENRE/FORM
Genre/form data or focus term Electronic books.
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Print version:
International Standard Book Number 9781450399739
-- 9781450399715
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title ACM books - Collection 2 ;
Volume/sequential designation #47.
856 40 - ELECTRONIC LOCATION AND ACCESS
Materials specified Abstract with links to full text
Uniform Resource Identifier <a href="https://doi.org/10.1145/3568325">https://doi.org/10.1145/3568325</a>

No items available.