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

  • Home
  • SEARCH
  • 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 3308438
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 17, 20262026-05-17T21:31:19+00:00 2026-05-17T21:31:19+00:00

As i understand Haskell does not have a global state, so is there any

  • 0

As i understand Haskell does not have a global state, so is there any way to write a function f that will return f(n – 1) + 1, where n is a number of function call and f(1) = 0.

It should not accept any arguments and used like func f

Prelude> f () 
0
Prelude> f ()
1
  • 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-17T21:31:19+00:00Added an answer on May 17, 2026 at 9:31 pm

    Without using tricks like unsafePerform, it is not possible to define a function that can be called like you showed in your example. However it is possible to define an IO action that does what you want and could be used like this:

    Prelude> x <- f 
    Prelude> x
    0
    Prelude> x <- f
    Prelude> x
    1
    

    Here’s an example program that does what you want using IORefs:

    import Data.IORef
    
    main = do counter <- newIORef 0
              let f = do count <- readIORef counter
                         modifyIORef counter (+ 1)
                         return count          
              x <- f
              print x
              x <- f
              print x
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have some Haskell code that does work correctly on an infinite list, but
I understand that some countries have laws regarding website accessibility. In general, what are
I understand that there are several ways to blend XNA and WPF within the
I am new at haskell, I have to write a program context-aware,so I thought
I'm trying to fully understand all of Haskell's concepts. In what ways are algebraic
I understand what System.WeakReference does, but what I can't seem to grasp is a
I understand the main function of the lock key word from MSDN lock Statement
I have two Haskell functions, both of which seem very similar to me. But
I'm working my way through the book The Haskell Road to Logic, Maths and
I understand that the system may kill the activity without calling onDestroy(). Say I

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.