Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 205007
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 11, 20262026-05-11T17:31:05+00:00 2026-05-11T17:31:05+00:00

On F# WikiBook under Encapsulating Mutable State section, there is a following code snippet.

  • 0

On F# WikiBook under Encapsulating Mutable State section, there is a following code snippet.

> let incr =
    let counter = ref 0
    fun () ->
        counter := !counter + 1
        !counter;;

val incr : (unit -> int)

> incr();;
val it : int = 1

> incr();;
val it : int = 2

> incr();;
val it : int = 3

At first, it seemed easy enough to swallow the fact that, mutable counter value increments everytime incr is invoked.

But after thinking about it for awhile, what I couldn’t understand were when counter is freed from heap and also how counter still refers to previous value before being incremented. How is counter that lives within incr function scope survive through multiple function calls?

So main questions are:

  • When does counter freed from heap?
  • Isn’t counter a memory leak?
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-11T17:31:06+00:00Added an answer on May 11, 2026 at 5:31 pm

    The distinction between ‘lexical scope’ (where a name has meaning in the text of a program) and ‘lifetime’ (runtime duration between when object is created and destroyed) can sometimes be confusing, since often these two are highly correlated. However the technique demonstrated by this example is common in functional languages: you give an implementation detail a small lexical scope (that hides the implementation details from callers), but extend its lifetime by capturing it in a closure (so that its lifetime becomes the lifetime of the enclosing object – in this instance the ‘incr’ function). This is a common way to do encapsulation in functional programming (contrasted with the usual encapsulation technique of public/private in classes in object-oriented programming).

    Now, in this particular example, it looks like ‘incr’ is a top-level function, which means its value lasts for the lifetime of the program (or interactive session if typing into fsi.exe). You could call this a ‘leak’, but it depends on intent. If you have some unique id counter you need for the entire lifetime of your entire program, then you are going to have to store that counter varable somewhere that it lasts for the whole program. So either this is ‘a leak’ or ‘a by design feature’ depending on how ‘incr’ will be used (will you need to use that function for the whole rest of the program?). In any case, the key point here is that ‘incr’ holds memory resources, so if you won’t need those resources forever, you should arrange for the closure referenced by ‘incr’ to become unreachable when it is no longer needed. Commonly this might be by making it local to some other function, e.g.

    let MyComplicatedFuncThatNeedsALocalCounter args =
        let incr = 
            // as before
        // other code that uses incr
        // return some result that does not capture incr
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Ask A Question

Stats

  • Questions 122k
  • Answers 122k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer Sprocs can be strongly-typed by calling ExecuteTypedList() I would create… May 12, 2026 at 12:46 am
  • Editorial Team
    Editorial Team added an answer Personally, I think it would depend on the complexity of… May 12, 2026 at 12:46 am
  • Editorial Team
    Editorial Team added an answer It seems to me that from the point of view… May 12, 2026 at 12:46 am

Related Questions

I was following some examples on F# Wikibook on High Order Functions . Second
I was doing an exercise on F# Wiki Book on List (scroll to the
I'm working on a 10 page web site with a database back-end. There are
Assuming I have a left outer join as such: from f in Foo join

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.