About 193,000 results
Open links in new tab
  1. functional programming - Efficient Immutable Map

    Aug 21, 2009 · I'm wondering if there is an implementation of a map which is: Immutable, so that I can use it in functional programming, and effortlessly ensure transactions and concurrency. Fast. I've checked out Binary Search Trees (RB, AVL) and Tries, but none of them seemed to be as fast as Hash Tables.

  2. The Power of Immutability in Functional Programming

    Nov 4, 2024 · With immutability, you can scale your applications more efficiently and reliably. Let’s dive into a practical example to illustrate how immutability works in functional programming. Suppose we want to build a map that counts the occurrences of each character in a string. Here’s an example in a functional programming style using Haskell:

  3. Functional Programming and Immutable Data Structures

    Oct 20, 2024 · Functional programming (FP) offers a robust solution through immutability, which simplifies reasoning about programs and ensures safe, concurrent execution. Immutable data structures, in...

  4. Immutable data structures and efficiency: what am I missing?

    May 6, 2024 · Functional programming with immutable data structures allows for parallelism in a more manageable way. Great talk by guy Steele where he solves a typical interview question in three ways. Functional languages tend to push you towards a solution that works in parallel.

  5. Kinda Functional | A Guide on Functional Programming - Functional

    Maps in functional programming also adhere to immutability. Any update operation results in a new map instance with the updated data. Immutability: Guarantees that data cannot be altered, eliminating side effects. Persistence: Efficiently share structure between versions of the data to save memory and processing time.

  6. functional programming: immutable data structure efficiency

    Nov 2, 2009 · Techniques for doing this are explained in the excellent Purely Functional Data Structures (book, thesis). Take a look at the Zipper data structure. If the garbage collector is doing its job, the older copies of the data structure will be reclaimed when they're no longer being used.

  7. Immutability in Functional Programming - Ada Beat

    We’ll explore what immutability means, why it’s a cornerstone of functional programming, and how it enhances the reliability and efficiency of your code. By understanding immutability, you’ll unlock a key technique that can lead to cleaner, safer, and more parallelizable programs.

  8. The efficiency of Functional Programming: Less code, more power

    Immutability: In functional programming, data is treated as immutable. This means that once a piece of data is created, it cannot be modified. Instead, any operation on data creates new data structures. Immutability eliminates a major source of bugs in software development related to unexpected side effects and shared mutable state.

  9. To-many or to-one? all-in-one! efficient purely functional multi-maps

    Jun 11, 2018 · We detail the design and optimizations of AXIOM and further compare it against state-of-the-art immutable maps and multi-maps in Java, Scala and Clojure. We isolate key differences using microbenchmarks and validate the resulting conclusions on a …

  10. Immutability – Practical Functional Programming | Part 3

    In this article, we are going to learn what Immutability means, what is an immutable collection, and how can you use immutability effectively. Practical Functional Programming step by step is a series in which we are going to uncover the principles of functional programming and effective coding one small piece at the time.

Refresh