Infinite lists aka streams
-
Updated
Oct 27, 2024 - Haskell
Infinite lists aka streams
Nλ is a simple functional programming language aimed at manipulating infinite, but first-order definable structures, such as the countably infinite clique graph or the set of all intervals with rational endpoints.
A Smalltalk port of https://srfi.schemers.org/srfi-41/srfi-41.html
Haskell implementation of the square root series approximation
Add a description, image, and links to the infinite-data-structure topic page so that developers can more easily learn about it.
To associate your repository with the infinite-data-structure topic, visit your repo's landing page and select "manage topics."