<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>functional programming on ankit bahuguna</title>
    <link>https://ankitbahuguna.xyz/tags/functional-programming/</link>
    <description>Recent content in functional programming on ankit bahuguna</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <lastBuildDate>Tue, 15 Aug 2023 01:55:25 +0530</lastBuildDate>
    <atom:link href="https://ankitbahuguna.xyz/tags/functional-programming/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Tail recursion</title>
      <link>https://ankitbahuguna.xyz/posts/undertanding-tail-recursion/</link>
      <pubDate>Tue, 15 Aug 2023 01:55:25 +0530</pubDate>
      <guid>https://ankitbahuguna.xyz/posts/undertanding-tail-recursion/</guid>
      <description>I&amp;rsquo;ve been playing around with OCaml lately and wanted to understand how tail recursion works. According to Wikipedia:
&amp;ldquo;In computer science, a tail call is a subroutine call performed as the final action of a procedure. If the target of a tail is the same subroutine, the subroutine is said to be tail recursive, which is a special case of direct recursion.&amp;rdquo;
Non-Tail Recursive Sum Function in OCaml Here&amp;rsquo;s a non-tail recursive sum function in OCaml:</description>
    </item>
  </channel>
</rss>
