<?xml version="1.0" encoding="windows-1251"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
<title><![CDATA[Çàêëàäêè íà LINKS.I.UA]]></title>
<link>https://links.i.ua/66123/</link>
<description><![CDATA[RSS-ëåíòà çàêëàäîê]]></description>
<image>
<url>//i.i.ua/logo.gif</url>
<title><![CDATA[Çàêëàäêè íà LINKS.I.UA]]></title>
<link>https://links.i.ua/66123/</link>
</image>

<item>
<title><![CDATA[fa.caml Lists]]></title>
<link>https://groups.google.com/group/fa.caml/browse_thread/thread/541dedf6ec56e9f4/fc544821e266278d</link>
<guid>https://groups.google.com/group/fa.caml/browse_thread/thread/541dedf6ec56e9f4/fc544821e266278d</guid>
<description><![CDATA[fa.caml minor discussion on Lists]]></description>
<dc:creator><![CDATA[bobbie]]></dc:creator>
<pubDate>Thu, 01 Jan 1970 03:00:00 +0300</pubDate>
</item>
<item>
<title><![CDATA[Functional lists and deques from chap 7]]></title>
<link>https://ocaml.info/ocaml_sources/pure-fun-1.0.6/chp7.ml</link>
<guid>https://ocaml.info/ocaml_sources/pure-fun-1.0.6/chp7.ml</guid>
<description><![CDATA[Functional lists and deques from chapter 7 of the «Purely Functional Data structures»]]></description>
<dc:creator><![CDATA[bobbie]]></dc:creator>
<pubDate>Thu, 01 Jan 1970 03:00:00 +0300</pubDate>
</item>
<item>
<title><![CDATA[Example queue implementations]]></title>
<link>https://cs.utah.edu/classes/cs7963-mflatt/queue.ml</link>
<guid>https://cs.utah.edu/classes/cs7963-mflatt/queue.ml</guid>
<description><![CDATA[Example queue implementations For cs7963, Spring 2005 Robert Ricci Some of these data structures come from the book:  "Purely Functional Data Structures", by Chris Okasaki Another good resource (paricularly for ocaml's lazy evaluation]]></description>
<dc:creator><![CDATA[bobbie]]></dc:creator>
<pubDate>Thu, 01 Jan 1970 03:00:00 +0300</pubDate>
</item>
<item>
<title><![CDATA[Ocaml Lazy Lists- An Introduction]]></title>
<link>https://enfranchisedmind.com/blog/archive/2007/01/01/177</link>
<guid>https://enfranchisedmind.com/blog/archive/2007/01/01/177</guid>
<description><![CDATA[In Ocaml, the keyword ‘lazy’ is used before an expression to capture the expression as a lazy thunk. The function Lazy.force can be used to then force the lazy thunk and return the value. An example of this makes things more clear. One advantage Ocaml has]]></description>
<dc:creator><![CDATA[bobbie]]></dc:creator>
<pubDate>Thu, 01 Jan 1970 03:00:00 +0300</pubDate>
</item>

</channel>
</rss>
