Functional data structures algorithms (83 résultats)

Etat : Good. Has some wear and creases. Has a remainder mark. paperback Used - Good 2025.

Etat : very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail.…

Etat : New.

Paperback or Softback. Etat : New. Learning F# Functional Data Structures and Algorithms. Book.

Etat : New.

Etat : New.

Etat : New.

Paperback or Softback. Etat : New. Learning Functional Data Structures and Algorithms. Book.

Etat : As New. Unread book in perfect condition.

Digital. Etat : New. COM051000.

Etat : New.

Etat : As New. Unread book in perfect condition.

PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Etat : New.

Etat : New. pp. 206.

Etat : New.

Etat : New.

Paperback. Etat : New. This book is an introduction to data structures and algorithms for functional programming languages, with a focus on proofs. Starting with sorting and searching, it moves on to priority queues and advanced design and analysis techniques: dynamic programming, amortized analysis, splay trees, skew heaps and pairing heaps. The final part of the book covers a number of selected fun topics: graph algorithms, string search, Huffman's algorithm for generating optimal codes and alpha-beta pruning of game trees. The book covers both correctness (does the algorithm do what it is supposed to do?) and running time analysis (does the algorithm terminate within a specified number of steps?). It does so in a unified manner with inductive proofs about functional programs and their running time functions. What sets this book apart from existing books on algorithms is that all proofs have been machine-checked, by the proof assistant Isabelle. That is, in addition to the text in the book, which requires no knowledge of proof assistants!, the Isabelle definitions and proofs are available online. The structured nature of Isabelle proofs permits even novices to follow the high-level arguments. This book is aimed at teachers and students (it has been classroom-tested for a number of years) but is also a reference work for programmers and researchers who are interested in the (verified!) details of some algorithm or proof.…

Etat : New. In English.

Digital. Etat : New. Learn functional data structures and algorithms for your applications and bring their benefits to your work nowAbout This Book. Moving from object-oriented programming to functional programming? This book will help you get started with functional programming. Easy-to-understand explanations of practical topics will help you get started with functional data structures. Illustrative diagrams to explain the algorithms in detail. Get hands-on practice of Scala to get the most out of functional programming.Who This Book Is ForThis book is for those who have some experience in functional programming languages. The data structures in this book are primarily written in Scala, however implementing the algorithms in other functional languages should be straight forward.What You Will Learn. Learn to think in the functional paradigm. Understand common data structures and the associated algorithms, as well as the context in which they are commonly used. Take a look at the runtime and space complexities with the O notation. See how ADTs are implemented in a functional setting. Explore the basic theme of immutability and persistent data structures. Find out how the internal algorithms are redesigned to exploit structural sharing, so that the persistent data structures perform well, avoiding needless copying. Get to know functional features like lazy evaluation and recursion used to implement efficient algorithms. Gain Scala best practices and idiomsIn DetailFunctional data structures have the power to improve the codebase of an application and improve efficiency. With the advent of functional programming and with powerful functional languages such as Scala, Clojure and Elixir becoming part of important enterprise applications, functional data structures have gained an important place in the developer toolkit. Immutability is a cornerstone of functional programming. Immutable and persistent data structures are thread safe by definition and hence very appealing for writing robust concurrent programs.How do we express traditional algorithms in functional setting? Won't we end up copying too much? Do we trade performance for versioned data structures?This book attempts to answer these questions by looking at functional implementations of traditional algorithms.It begins with a refresher and consolidation of what functional programming is all about. Next, you'll get to know about Lists, the work horse data type for most functional languages. We show what structural sharing means and how it helps to make immutable data structures efficient and practical.Scala is the primary implementation languages for most of the examples. At times, we also present Clojure snippets to illustrate the underlying fundamental theme. While writing code, we use ADTs (abstract data types). Stacks, Queues, Trees and Graphs are all familiar ADTs. You will see how these ADTs are implemented in a functional setting. We look at implementation techniques like amortization and lazy evaluation.…

Etat : New. In English.

Etat : new.

Etat : New.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New.

Etat : New. In English.

Paperback. Etat : New. This book is an introduction to data structures and algorithms for functional programming languages, with a focus on proofs. Starting with sorting and searching, it moves on to priority queues and advanced design and analysis techniques: dynamic programming, amortized analysis, splay trees, skew heaps and pairing heaps. The final part of the book covers a number of selected fun topics: graph algorithms, string search, Huffman's algorithm for generating optimal codes and alpha-beta pruning of game trees. The book covers both correctness (does the algorithm do what it is supposed to do?) and running time analysis (does the algorithm terminate within a specified number of steps?). It does so in a unified manner with inductive proofs about functional programs and their running time functions. What sets this book apart from existing books on algorithms is that all proofs have been machine-checked, by the proof assistant Isabelle. That is, in addition to the text in the book, which requires no knowledge of proof assistants!, the Isabelle definitions and proofs are available online. The structured nature of Isabelle proofs permits even novices to follow the high-level arguments. This book is aimed at teachers and students (it has been classroom-tested for a number of years) but is also a reference work for programmers and researchers who are interested in the (verified!) details of some algorithm or proof.…

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.