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 4324608
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 21, 20262026-05-21T09:09:21+00:00 2026-05-21T09:09:21+00:00

How do I create a recursive anonymous function in Clojure which is not tail

  • 0

How do I create a recursive anonymous function in Clojure which is not tail recursive?

The following clearly doesn’t work, as recur is only for tail recursive functions. I’m also reluctant to drag in a y-combinator..

((fn [n] (if (= 1 n) 1 (* n (recur (dec n))))) 5)
  • 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-21T09:09:21+00:00Added an answer on May 21, 2026 at 9:09 am

    Functions can be given a name to refer to themselves by specifying it between fn and the arglist:

    user> ((fn ! [n] (if (= 1 n) 1 (* n (! (dec n))))) 5)
    120
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm trying to create a boolean recursive function which accepts 1 parameter only and
i hoping to create a recursive function which i don't have an idea yet
I'm trying to create a modulus function within haskell using primtive recursive functions. I
I try to create a binary tree as html-table which is not recursive build.
The problem: To create a recursive array function that walks through a three dimensional
i use kohana framework and i am trying to code recursive function to create
I'm trying to create a recursive function in coldfusion and am coming across some
Text below is from Django docs which provide To create a recursive relationship –
The following code is how I'm trying to create a recursive binary method.. public
I'm attempting to create a recursive function that outputs a vector of strings that

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.