Why is seemingly infinite (lazy) recursion faster?

This page summarizes the projects mentioned and recommended in the original post on reddit.com/r/haskell

Our great sponsors
  • SonarQube - Static code analysis for 29 languages.
  • Scout APM - Less time debugging, more time building
  • SaaSHub - Software Alternatives and Reviews
  • Exercism - website

    The codebase for Exercism's website. (by exercism)

    This is based on the "nth prime" exercism.org exercise - https://exercism.org/tracks/haskell/exercises/nth-prime

  • containers

    Assorted concrete container types

    Edison and containers both have sequence types that support efficient, cons, snoc, viewL, viewR, append, map, and length.

  • SonarQube

    Static code analysis for 29 languages.. Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a more popular project.

Suggest a related project

Related posts