<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/draganigajic/FP"><title>BibSonomy bookmarks for /user/draganigajic/FP</title><link>https://www.bibsonomy.org/user/draganigajic/FP</link><description>BibSonomy RSS Feed for /user/draganigajic/FP</description><items><rdf:Seq><rdf:li rdf:resource="http://lamp.epfl.ch/~emir/bqbase/2005/01/20/monad.html"/><rdf:li rdf:resource="http://debasishg.blogspot.com/2008/03/maybe-scala.html"/><rdf:li rdf:resource="http://james-iry.blogspot.com/"/><rdf:li rdf:resource="http://www.flapjax-lang.org/docs/"/><rdf:li rdf:resource="http://www.codepoetics.com/wiki/index.php?title=Topics:SICP_in_other_languages"/><rdf:li rdf:resource="http://www.cs.ru.nl/~clean/About_Clean/tutorial/body_tutorial.html"/><rdf:li rdf:resource="http://www.eecs.usma.edu/Personnel/okasaki/pubs.html"/><rdf:li rdf:resource="http://www.csse.monash.edu.au/~lloyd/"/><rdf:li rdf:resource="http://www.erlang.org/links.html"/><rdf:li rdf:resource="http://www.cs.ru.nl/fple/new.html"/><rdf:li rdf:resource="http://research.microsoft.com/~emeijer/Papers/XMLRefactored.html"/><rdf:li rdf:resource="http://www.csse.monash.edu.au/~lloyd/tildeFP/1990BCJ/"/><rdf:li rdf:resource="http://okasaki.blogspot.com/search/label/teaching"/><rdf:li rdf:resource="http://lampwww.epfl.ch/funnel/"/><rdf:li rdf:resource="http://conal.net/"/><rdf:li rdf:resource="http://nixos.org/nixos/"/><rdf:li rdf:resource="http://www.vector-seven.com/2007/10/03/the-many-humps-of-ocaml-part-2/"/><rdf:li rdf:resource="http://en.wikipedia.org/wiki/Monads_in_functional_programming"/><rdf:li rdf:resource="http://nixos.org/releases/nixos-unstable-latest/manual/"/><rdf:li rdf:resource="http://holumbus.fh-wedel.de/"/></rdf:Seq></items></channel><item rdf:about="http://lamp.epfl.ch/~emir/bqbase/2005/01/20/monad.html"><title>Monads in Scala tutorial</title><description>emir burak  In Informatics, there are two (related) meanings of the word &#034;monad&#034;:     * A triple (T,eta,mu) following some laws in category theory     * A way of structuring functional programs The first meaning can probably not be described easily in natural language. Michael Arbib and Ernest Manes&#039; &#034;Arrows, Structure, Functors - The Categorical Imperative&#034;. describe them as (generalized monoids) in Section 10.2 and through adjointness to the forgetful functor from algebras to sets. That last connection basically makes everything that we can write down or model using abstract syntax / universal algebra a monad. The second view is described in Wadler&#039;s papers. I mention category theory  because  we can describe things that are not computations as monads. It also reminds us why a monad is a collection of things taken together. With the List example in mind, a potentially more revealing account on monads (aka triples) can be found in the free book Barr, Wells</description><link>http://lamp.epfl.ch/~emir/bqbase/2005/01/20/monad.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:52+02:00</dc:date><dc:subject>*read fp monads scala tutorial </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;emir burak  In Informatics, there are two (related) meanings of the word &amp;#034;monad&amp;#034;:     * A triple (T,eta,mu) following some laws in category theory     * A way of structuring functional programs The first meaning can probably not be described easily in natural language. Michael Arbib and Ernest Manes&amp;#039; &amp;#034;Arrows, Structure, Functors - The Categorical Imperative&amp;#034;. describe them as (generalized monoids) in Section 10.2 and through adjointness to the forgetful functor from algebras to sets. That last connection basically makes everything that we can write down or model using abstract syntax / universal algebra a monad. The second view is described in Wadler&amp;#039;s papers. I mention category theory  because  we can describe things that are not computations as monads. It also reminds us why a monad is a collection of things taken together. With the List example in mind, a potentially more revealing account on monads (aka triples) can be found in the free book Barr, Wells&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*read"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/monads"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scala"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/></rdf:Bag></taxo:topics></item><item rdf:about="http://debasishg.blogspot.com/2008/03/maybe-scala.html"><title>Ruminations of a Programmer: Maybe Scala</title><description>Just fire up your REPL and see for yourself how the malleable syntactic structures of the language grow in front of your eyes, alongside your program. Whether this is through Lisp macros or Ruby meta-programming or Scala control structures, the secret sauce is in the ability to implement more and more powerful abstractions within the language. But what makes one language shine more compared to another is the ability to combine abstractions leading to more powerful syntactic structures. Recently people have been talking about the Maybe monad and its myriads of implementation possibilities in Ruby. Because of its dynamic nature and powerful meta-programming facilities, Ruby allows you to write this .. @phone = Location.find(:first, ...elided... ).andand.phone Here andand is an abstraction of the Maybe monad that you can seamlessly compose with core Ruby syntax structures, effectively growing the Ruby language.</description><link>http://debasishg.blogspot.com/2008/03/maybe-scala.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:52+02:00</dc:date><dc:subject>blogpost fp monads scala </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Just fire up your REPL and see for yourself how the malleable syntactic structures of the language grow in front of your eyes, alongside your program. Whether this is through Lisp macros or Ruby meta-programming or Scala control structures, the secret sauce is in the ability to implement more and more powerful abstractions within the language. But what makes one language shine more compared to another is the ability to combine abstractions leading to more powerful syntactic structures. Recently people have been talking about the Maybe monad and its myriads of implementation possibilities in Ruby. Because of its dynamic nature and powerful meta-programming facilities, Ruby allows you to write this .. @phone = Location.find(:first, ...elided... ).andand.phone Here andand is an abstraction of the Maybe monad that you can seamlessly compose with core Ruby syntax structures, effectively growing the Ruby language.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blogpost"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/monads"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scala"/></rdf:Bag></taxo:topics></item><item rdf:about="http://james-iry.blogspot.com/"><title>One Div Zero</title><description>james iry</description><link>http://james-iry.blogspot.com/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:52+02:00</dc:date><dc:subject>! *read blog fp java monads programming scala </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;james iry&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/!"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*read"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/java"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/monads"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scala"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.flapjax-lang.org/docs/"><title>Flapjax</title><description></description><link>http://www.flapjax-lang.org/docs/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:51+02:00</dc:date><dc:subject>ajax fp frp javascript </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:51+02:00&#034; href=&#034;http://www.flapjax-lang.org/docs/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.flapjax-lang.org/docs/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ajax"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/javascript"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.codepoetics.com/wiki/index.php?title=Topics:SICP_in_other_languages"><title>Topics:SICP in other languages - CTMWiki</title><description></description><link>http://www.codepoetics.com/wiki/index.php?title=Topics:SICP_in_other_languages</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:47+02:00</dc:date><dc:subject>*read 100+ Scala algorithms cs education erlang examples fp haskell javascript lisp lua ocaml pl python qi ruby scheme sicp tutorial wiki </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:47+02:00&#034; href=&#034;http://www.codepoetics.com/wiki/index.php?title=Topics:SICP_in_other_languages&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.codepoetics.com/wiki/index.php?title=Topics:SICP_in_other_languages&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*read"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/100+"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Scala"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/education"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/erlang"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/examples"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/javascript"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lisp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lua"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ocaml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/python"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/qi"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ruby"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scheme"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sicp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wiki"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.ru.nl/~clean/About_Clean/tutorial/body_tutorial.html"><title>Language Impression</title><description></description><link>http://www.cs.ru.nl/~clean/About_Clean/tutorial/body_tutorial.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:46+02:00</dc:date><dc:subject>FP clean tutorial </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:46+02:00&#034; href=&#034;http://www.cs.ru.nl/~clean/About_Clean/tutorial/body_tutorial.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.ru.nl/~clean/About_Clean/tutorial/body_tutorial.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/FP"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/clean"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.eecs.usma.edu/Personnel/okasaki/pubs.html"><title>Chris Okasaki&#039;s Publications</title><description></description><link>http://www.eecs.usma.edu/Personnel/okasaki/pubs.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:46+02:00</dc:date><dc:subject>bibliography fp okasaki papers </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:46+02:00&#034; href=&#034;http://www.eecs.usma.edu/Personnel/okasaki/pubs.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.eecs.usma.edu/Personnel/okasaki/pubs.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bibliography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/okasaki"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/papers"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.csse.monash.edu.au/~lloyd/"><title>Lloyd Allison FP</title><description></description><link>http://www.csse.monash.edu.au/~lloyd/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:46+02:00</dc:date><dc:subject>FP algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:46+02:00&#034; href=&#034;http://www.csse.monash.edu.au/~lloyd/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.csse.monash.edu.au/~lloyd/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/FP"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.erlang.org/links.html"><title>Links and various Erlang related activities</title><description></description><link>http://www.erlang.org/links.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:46+02:00</dc:date><dc:subject>Erlang FP </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:46+02:00&#034; href=&#034;http://www.erlang.org/links.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.erlang.org/links.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Erlang"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/FP"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.ru.nl/fple/new.html"><title>FPLE: New Things</title><description></description><link>http://www.cs.ru.nl/fple/new.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:46+02:00</dc:date><dc:subject>FP </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:46+02:00&#034; href=&#034;http://www.cs.ru.nl/fple/new.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.ru.nl/fple/new.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/FP"/></rdf:Bag></taxo:topics></item><item rdf:about="http://research.microsoft.com/~emeijer/Papers/XMLRefactored.html"><title>XLinq: XML Programming Refactored (The Return Of The Monoids)</title><description></description><link>http://research.microsoft.com/~emeijer/Papers/XMLRefactored.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:46+02:00</dc:date><dc:subject>FP XML emeijer linq monads </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:46+02:00&#034; href=&#034;http://research.microsoft.com/~emeijer/Papers/XMLRefactored.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://research.microsoft.com/~emeijer/Papers/XMLRefactored.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/FP"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/XML"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/emeijer"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/linq"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/monads"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.csse.monash.edu.au/~lloyd/tildeFP/1990BCJ/"><title>Continuations implement generators and streams</title><description></description><link>http://www.csse.monash.edu.au/~lloyd/tildeFP/1990BCJ/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:46+02:00</dc:date><dc:subject>FP </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:46+02:00&#034; href=&#034;http://www.csse.monash.edu.au/~lloyd/tildeFP/1990BCJ/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.csse.monash.edu.au/~lloyd/tildeFP/1990BCJ/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/FP"/></rdf:Bag></taxo:topics></item><item rdf:about="http://okasaki.blogspot.com/search/label/teaching"><title>Teaching, Playing, and Programming: teaching</title><description></description><link>http://okasaki.blogspot.com/search/label/teaching</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:43+02:00</dc:date><dc:subject>blog fp haskell okasaki </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:43+02:00&#034; href=&#034;http://okasaki.blogspot.com/search/label/teaching&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://okasaki.blogspot.com/search/label/teaching&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/okasaki"/></rdf:Bag></taxo:topics></item><item rdf:about="http://lampwww.epfl.ch/funnel/"><title>Functional Nets</title><description></description><link>http://lampwww.epfl.ch/funnel/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:39+02:00</dc:date><dc:subject>cs fp pl research </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:39+02:00&#034; href=&#034;http://lampwww.epfl.ch/funnel/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://lampwww.epfl.ch/funnel/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/></rdf:Bag></taxo:topics></item><item rdf:about="http://conal.net/"><title>Conal Elliott&#039;s home page</title><description></description><link>http://conal.net/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:39+02:00</dc:date><dc:subject>cs fp ftp graphics haskell people research </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:39+02:00&#034; href=&#034;http://conal.net/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://conal.net/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ftp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/people"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/></rdf:Bag></taxo:topics></item><item rdf:about="http://nixos.org/nixos/"><title>NixOS</title><description></description><link>http://nixos.org/nixos/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:35+02:00</dc:date><dc:subject>fp linux os </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:35+02:00&#034; href=&#034;http://nixos.org/nixos/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://nixos.org/nixos/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/linux"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/os"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.vector-seven.com/2007/10/03/the-many-humps-of-ocaml-part-2/"><title>Thomas Lee » The Many Humps of Ocaml, Part 2</title><description></description><link>http://www.vector-seven.com/2007/10/03/the-many-humps-of-ocaml-part-2/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:35+02:00</dc:date><dc:subject>fp ocaml tutorial </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:35+02:00&#034; href=&#034;http://www.vector-seven.com/2007/10/03/the-many-humps-of-ocaml-part-2/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.vector-seven.com/2007/10/03/the-many-humps-of-ocaml-part-2/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ocaml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/></rdf:Bag></taxo:topics></item><item rdf:about="http://en.wikipedia.org/wiki/Monads_in_functional_programming"><title>Monad (functional programming) - Wikipedia, the free encyclopedia</title><description></description><link>http://en.wikipedia.org/wiki/Monads_in_functional_programming</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:35+02:00</dc:date><dc:subject>100+ categoryTheory cs fp monads wikipedia </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:35+02:00&#034; href=&#034;http://en.wikipedia.org/wiki/Monads_in_functional_programming&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://en.wikipedia.org/wiki/Monads_in_functional_programming&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/100+"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/categoryTheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/monads"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wikipedia"/></rdf:Bag></taxo:topics></item><item rdf:about="http://nixos.org/releases/nixos-unstable-latest/manual/"><title>NixOS Manual</title><description></description><link>http://nixos.org/releases/nixos-unstable-latest/manual/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:35+02:00</dc:date><dc:subject>fp </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:35+02:00&#034; href=&#034;http://nixos.org/releases/nixos-unstable-latest/manual/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://nixos.org/releases/nixos-unstable-latest/manual/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://holumbus.fh-wedel.de/"><title>Holumbus</title><description></description><link>http://holumbus.fh-wedel.de/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:34+02:00</dc:date><dc:subject>fp haskell indexing library search searchengine </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:34+02:00&#034; href=&#034;http://holumbus.fh-wedel.de/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://holumbus.fh-wedel.de/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/indexing"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/library"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/searchengine"/></rdf:Bag></taxo:topics></item></rdf:RDF>