<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (marmolubio)</title>
    <link>https://pinboard.in/u:marmolubio/public/</link>
    <description>recent bookmarks from marmolubio</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://vimeo.com/6622658"/>
	<rdf:li rdf:resource="http://mas.lvc.edu/~walck/phy261/syl261.html"/>
	<rdf:li rdf:resource="http://ocharles.org.uk/blog/posts/2014-05-02-well-typed-guide-haskell-type-system.html"/>
	<rdf:li rdf:resource="http://hackage.haskell.org/package/snap-web-routes-0.4.0.0"/>
	<rdf:li rdf:resource="https://www.fpcomplete.com/user/snoyberg/general-haskell/basics/foldable-mapm-maybe-and-recursive-functions"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/24rs73/75m_dod_grant_to_develop_homotopy_type_theory/chaao8d"/>
	<rdf:li rdf:resource="http://martijn.van.steenbergen.nl/journal/2009/11/12/gadts-in-haskell-98/"/>
	<rdf:li rdf:resource="http://martijn.van.steenbergen.nl/journal/2009/10/18/transforming-polymorphic-values/"/>
	<rdf:li rdf:resource="http://okmij.org/ftp/tagless-final/course/"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/1ohe9m/open_question_help_me_design_a_new_encoding_api/"/>
	<rdf:li rdf:resource="http://robots.thoughtbot.com/thinking-in-types"/>
	<rdf:li rdf:resource="https://news.ycombinator.com/item?id=7686690"/>
	<rdf:li rdf:resource="http://stackoverflow.com/questions/12617916/why-is-listt-monad-transformer-considered-buggy-what-monad-laws-it-breaks"/>
	<rdf:li rdf:resource="http://www.haskell.org/wikiupload/1/14/TMR-Issue6.pdf"/>
	<rdf:li rdf:resource="http://hackage.haskell.org/package/semigroupoids-4.0.1"/>
	<rdf:li rdf:resource="https://www.fpcomplete.com/user/icelandj/Pattern%20synonyms"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/24cq0u/the_identity_monad_trick/"/>
	<rdf:li rdf:resource="https://r6research.livejournal.com/27476.html"/>
	<rdf:li rdf:resource="http://swizec.com/blog/week-20-making-ad-hoc-polymorphism-less-ad-hoc/swizec/6564"/>
	<rdf:li rdf:resource="http://bitemyapp.com/posts/2014-04-29-meditations-on-learning-haskell.html"/>
	<rdf:li rdf:resource="https://skillsmatter.com/skillscasts/5225-overloaded-record-fields-for-haskell"/>
	<rdf:li rdf:resource="http://ocharles.org.uk/blog/posts/2014-04-26-constructing-generically.html"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/243fm4/erik_meijer_the_curse_of_the_excluded_middle/"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/240j3z/a_neighborhood_of_infinity_the_monad_called_free/ch2kly8"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/23uzpg/lens_is_unidiomatic_haskell/ch0v5iw"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/23z5xb/lens_from_the_ground_up/ch24upg"/>
	<rdf:li rdf:resource="http://stackoverflow.com/questions/23280936/how-do-experienced-haskell-developers-approach-laziness-at-design-time/23282122#23282122"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/23q8kc/wreq_a_capable_new_http_client_library/ch0dwku"/>
	<rdf:li rdf:resource="http://www.diku.dk/~paba/pubs/entries/bahr13wgp.html"/>
	<rdf:li rdf:resource="http://dev.stephendiehl.com/hask/"/>
	<rdf:li rdf:resource="http://www.serpentine.com/wreq/"/>
	<rdf:li rdf:resource="http://typesandkinds.wordpress.com/2012/12/03/a-formalization-of-ghcs-core-language/"/>
	<rdf:li rdf:resource="http://research.microsoft.com/en-us/um/people/simonpj/papers/ext-f/"/>
	<rdf:li rdf:resource="https://ghc.haskell.org/trac/ghc/wiki/Commentary/Compiler/FC"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/23i6ih/announcing_cabal_120/"/>
	<rdf:li rdf:resource="http://ro-che.info/articles/2014-04-20-json-validation-combinators.html"/>
	<rdf:li rdf:resource="http://www.rbjones.com/rbjpub/logic/cl/tlc001.htm"/>
	<rdf:li rdf:resource="http://stackoverflow.com/questions/21219773/are-ghcs-type-famlies-an-example-of-system-f-omega"/>
	<rdf:li rdf:resource="http://hackage.haskell.org/package/Omega-1.0.1"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/23f138/finding_an_interesting_interface_for_simple_io_in/cgwda0l"/>
	<rdf:li rdf:resource="http://www.cs.bham.ac.uk/~mhe/papers/realadt.pdf"/>
	<rdf:li rdf:resource="http://www.haskell.org/haskellwiki/index.php?title=Functor-Applicative-Monad_Proposal&amp;diff=57884&amp;oldid=57165"/>
	<rdf:li rdf:resource="http://stackoverflow.com/questions/8963376/why-dont-type-synonyms-permit-recursion-in-haskell?rq=1"/>
	<rdf:li rdf:resource="http://jozefg.bitbucket.org/posts/2014-04-08-bargain-coroutines.html"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/2335mm/anyone_have_a_guide_to_reading_tapl/"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/2300zb/haskell_for_all_scalable_program_architectures/cgs77sw"/>
	<rdf:li rdf:resource="http://hackage.haskell.org/package/foldl-incremental-0.1.0.0"/>
	<rdf:li rdf:resource="https://groups.google.com/forum/#!msg/haskell-cafe/0Ebt6PJsd5o/a1tpyvNah98J"/>
	<rdf:li rdf:resource="http://jeltsch.wordpress.com/2013/02/14/the-constraint-kind/"/>
	<rdf:li rdf:resource="http://neilmitchell.blogspot.com.es/2010/12/installing-haskell-network-library-on.html"/>
	<rdf:li rdf:resource="http://hackage.haskell.org/package/free-functors-0.6.2"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/22ijq9/why_is_this_algorithm_so_much_slower_in_haskell/"/>
	<rdf:li rdf:resource="https://github.com/hvr/multi-ghc-travis"/>
	<rdf:li rdf:resource="http://hackage.haskell.org/package/packed-dawg"/>
	<rdf:li rdf:resource="http://www.yesodweb.com/blog/2014/04/proposal-changes-pvp"/>
	<rdf:li rdf:resource="https://skillsmatter.com/skillscasts/3932-a-haskell-lecture-with-leading-expert-andres-loh"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/22bm10/haskell_usage_in_the_real_world/cglakvz"/>
	<rdf:li rdf:resource="http://hackage.haskell.org/package/temporary-1.2.0.2"/>
	<rdf:li rdf:resource="http://conal.net/talks/elegant-memoization.pdf"/>
	<rdf:li rdf:resource="http://www.scs.stanford.edu/14sp-cs240h/slides/basics-slides.html#(53)"/>
	<rdf:li rdf:resource="https://www.fpcomplete.com/school/to-infinity-and-beyond/pick-of-the-week/guide-to-ghc-extensions/basic-syntax-extensions#multiwayif"/>
	<rdf:li rdf:resource="http://hackage.haskell.org/package/optparse-applicative-0.8.0.1/changelog"/>
	<rdf:li rdf:resource="http://neilmitchell.blogspot.com.es/2014/04/exceptional-testing.html"/>
	<rdf:li rdf:resource="http://hackage.haskell.org/package/snap-loader-dynamic-0.10.0.1/docs/Snap-Loader-Dynamic.html"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/21tusc/writing_a_simple_type_checker_with_bound/cgggjyt"/>
	<rdf:li rdf:resource="http://www.reddit.com/r/haskell/comments/21tusc/writing_a_simple_type_checker_with_bound/"/>
	<rdf:li rdf:resource="http://www.haskell.org/ghc/docs/7.8.1-rc2/html/users_guide/flag-reference.html#idp14537440"/>
	<rdf:li rdf:resource="http://hackage.haskell.org/package/base-4.6.0.1/docs/Data-Data.html#v:gfoldl"/>
	<rdf:li rdf:resource="http://curtis.io/posts/generating-data-uris-with-haskell.html"/>
	<rdf:li rdf:resource="http://hackage.haskell.org/package/combinat-0.2.5.0"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://vimeo.com/6622658">
    <title>Beautiful Diﬀerentiation on Vimeo</title>
    <dc:date>2014-05-08T19:19:46+00:00</dc:date>
    <link>http://vimeo.com/6622658</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell video calculus</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:9d665c103538/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:video"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:calculus"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://mas.lvc.edu/~walck/phy261/syl261.html">
    <title>Intro to Computational Physics (PHY 261)</title>
    <dc:date>2014-05-08T19:19:28+00:00</dc:date>
    <link>http://mas.lvc.edu/~walck/phy261/syl261.html</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>course haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:9f186543c98d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:course"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ocharles.org.uk/blog/posts/2014-05-02-well-typed-guide-haskell-type-system.html">
    <title>Well Typed's &quot;The Haskell Type System&quot; Course</title>
    <dc:date>2014-05-07T21:31:10+00:00</dc:date>
    <link>http://ocharles.org.uk/blog/posts/2014-05-02-well-typed-guide-haskell-type-system.html</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell lecture video</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:da77ae89422a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:lecture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:video"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hackage.haskell.org/package/snap-web-routes-0.4.0.0">
    <title>Hackage: snap-web-routes: Type safe URLs for Snap</title>
    <dc:date>2014-05-07T21:09:45+00:00</dc:date>
    <link>http://hackage.haskell.org/package/snap-web-routes-0.4.0.0</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell libraries</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:86aa492758d2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:libraries"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.fpcomplete.com/user/snoyberg/general-haskell/basics/foldable-mapm-maybe-and-recursive-functions">
    <title>Foldable.mapM_, Maybe, and recursive functions - School of Haskell | FP Complete</title>
    <dc:date>2014-05-06T20:23:08+00:00</dc:date>
    <link>https://www.fpcomplete.com/user/snoyberg/general-haskell/basics/foldable-mapm-maybe-and-recursive-functions</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell performance</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:9d3a6bc5bf1a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:performance"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/24rs73/75m_dod_grant_to_develop_homotopy_type_theory/chaao8d">
    <title>nbouscal comments on $7.5m DoD grant to develop Homotopy Type Theory</title>
    <dc:date>2014-05-05T19:52:39+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/24rs73/75m_dod_grant_to_develop_homotopy_type_theory/chaao8d</link>
    <dc:creator>marmolubio</dc:creator><description><![CDATA[Start by understanding dependent types and homotopy. Then, add homotopy to dependent types by making equality only hold up to homotopy, and declaring equality to be equivalent to equivalence1 . Then, start using equalities in your type formation rules to construct types with non-trivial homotopy. Then build mathematics.
So, what you probably want first is ELI5 dependent types and ELI5 homotopy.
1: There are many equivalent notions of equivalence for this, but your intuition of an isomorphism from any other area of math should be roughly close enough. I assume most five-year-olds have learned what an isomorphism is.]]></description>
<dc:subject>types haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:671d00f8ce63/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:types"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://martijn.van.steenbergen.nl/journal/2009/11/12/gadts-in-haskell-98/">
    <title>Martijn's Journal » GADTs in Haskell 98</title>
    <dc:date>2014-05-03T07:59:12+00:00</dc:date>
    <link>http://martijn.van.steenbergen.nl/journal/2009/11/12/gadts-in-haskell-98/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:92f3a40f2754/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://martijn.van.steenbergen.nl/journal/2009/10/18/transforming-polymorphic-values/">
    <title>Martijn's Journal » Transforming polymorphic values</title>
    <dc:date>2014-05-03T07:59:04+00:00</dc:date>
    <link>http://martijn.van.steenbergen.nl/journal/2009/10/18/transforming-polymorphic-values/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>dsl functional haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:f61dd4353b7b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:dsl"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:functional"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://okmij.org/ftp/tagless-final/course/">
    <title>Typed tagless-final interpretations: Lecture notes</title>
    <dc:date>2014-05-03T07:50:34+00:00</dc:date>
    <link>http://okmij.org/ftp/tagless-final/course/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell types patterns programming</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:749437221f82/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:types"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:patterns"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:programming"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/1ohe9m/open_question_help_me_design_a_new_encoding_api/">
    <title>Open question: help me design a new encoding API for aeson : haskell</title>
    <dc:date>2014-05-03T07:48:37+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/1ohe9m/open_question_help_me_design_a_new_encoding_api/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell tips</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:a44cd9575c75/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:tips"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://robots.thoughtbot.com/thinking-in-types">
    <title>Thinking in Types</title>
    <dc:date>2014-05-02T19:27:37+00:00</dc:date>
    <link>http://robots.thoughtbot.com/thinking-in-types</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:861d243709f7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://news.ycombinator.com/item?id=7686690">
    <title>Thinking in Types | Hacker News</title>
    <dc:date>2014-05-02T17:52:24+00:00</dc:date>
    <link>https://news.ycombinator.com/item?id=7686690</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:0bb91de19c33/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://stackoverflow.com/questions/12617916/why-is-listt-monad-transformer-considered-buggy-what-monad-laws-it-breaks">
    <title>haskell - Why is ListT monad transformer considered buggy - what monad laws it breaks? - Stack Overflow</title>
    <dc:date>2014-05-02T06:09:37+00:00</dc:date>
    <link>http://stackoverflow.com/questions/12617916/why-is-listt-monad-transformer-considered-buggy-what-monad-laws-it-breaks</link>
    <dc:creator>marmolubio</dc:creator><description><![CDATA[Versions of ListT along those lines fail to properly capture many uses of [], though--specifically, uses where a list is treated as a multiset instead of a sequence, i.e., finite lists where the order of elements doesn't matter. And of course that's precisely the problem--the broken ListT assumes that the order of (>>=) applications in the inner monad doesn't matter either, while the "done right" version inserts the wrapped monad at each step in a (possibly infinite) stream. The latter captures the "list as control structure" idea, and as such is related to iteratee-ish streams. ]]></description>
<dc:subject>haskell stackoverflow</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:9f4731fae6cd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:stackoverflow"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.haskell.org/wikiupload/1/14/TMR-Issue6.pdf">
    <title>[untitled]</title>
    <dc:date>2014-05-01T21:49:55+00:00</dc:date>
    <link>http://www.haskell.org/wikiupload/1/14/TMR-Issue6.pdf</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell reference</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:59a25c15ceb2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:reference"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hackage.haskell.org/package/semigroupoids-4.0.1">
    <title>Hackage: semigroupoids: Semigroupoids: Category sans id</title>
    <dc:date>2014-05-01T08:59:04+00:00</dc:date>
    <link>http://hackage.haskell.org/package/semigroupoids-4.0.1</link>
    <dc:creator>marmolubio</dc:creator><description><![CDATA[A Semigroupoid is a Category without the requirement of identity arrows for every object in the category.

A Category is any Semigroupoid for which the Yoneda lemma holds.]]></description>
<dc:subject>categories haskell libraries</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:8e046b876363/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:categories"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:libraries"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.fpcomplete.com/user/icelandj/Pattern%20synonyms">
    <title>Pattern Synonyms for Dates and an IRC Bot - School of Haskell | FP Complete</title>
    <dc:date>2014-05-01T08:54:15+00:00</dc:date>
    <link>https://www.fpcomplete.com/user/icelandj/Pattern%20synonyms</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell tips</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:00f1203a036a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:tips"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/24cq0u/the_identity_monad_trick/">
    <title>The Identity monad trick : haskell</title>
    <dc:date>2014-04-30T18:58:55+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/24cq0u/the_identity_monad_trick/</link>
    <dc:creator>marmolubio</dc:creator><description><![CDATA[h]]></description>
<dc:subject>haskell monads theory tips</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:0651aa68060f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:monads"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:tips"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://r6research.livejournal.com/27476.html">
    <title>r6research: Mainline Profunctor Heirarchy for Optics</title>
    <dc:date>2014-04-30T18:55:38+00:00</dc:date>
    <link>https://r6research.livejournal.com/27476.html</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell types theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:40c3558a5218/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:types"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://swizec.com/blog/week-20-making-ad-hoc-polymorphism-less-ad-hoc/swizec/6564">
    <title>Week 20: Making ad-hoc polymorphism less ad hoc | A geek with a hat</title>
    <dc:date>2014-04-30T18:52:26+00:00</dc:date>
    <link>http://swizec.com/blog/week-20-making-ad-hoc-polymorphism-less-ad-hoc/swizec/6564</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:8fbd1669f6b6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://bitemyapp.com/posts/2014-04-29-meditations-on-learning-haskell.html">
    <title>bitemyapp - Meditations on learning Haskell</title>
    <dc:date>2014-04-29T22:06:15+00:00</dc:date>
    <link>http://bitemyapp.com/posts/2014-04-29-meditations-on-learning-haskell.html</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell tips patterns</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:a9564e426bae/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:tips"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:patterns"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://skillsmatter.com/skillscasts/5225-overloaded-record-fields-for-haskell">
    <title>Skills Matter</title>
    <dc:date>2014-04-29T22:02:12+00:00</dc:date>
    <link>https://skillsmatter.com/skillscasts/5225-overloaded-record-fields-for-haskell</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell ghc</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:972349e13b42/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:ghc"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ocharles.org.uk/blog/posts/2014-04-26-constructing-generically.html">
    <title>Building data constructors with GHC Generics</title>
    <dc:date>2014-04-27T13:06:20+00:00</dc:date>
    <link>http://ocharles.org.uk/blog/posts/2014-04-26-constructing-generically.html</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:ab5558a50645/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/243fm4/erik_meijer_the_curse_of_the_excluded_middle/">
    <title>Erik Meijer: The Curse of the Excluded Middle : haskell</title>
    <dc:date>2014-04-27T10:58:52+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/243fm4/erik_meijer_the_curse_of_the_excluded_middle/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:85109cbafb7d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/240j3z/a_neighborhood_of_infinity_the_monad_called_free/ch2kly8">
    <title>Tekmo comments on A Neighborhood of Infinity: The Monad called Free</title>
    <dc:date>2014-04-26T15:58:08+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/240j3z/a_neighborhood_of_infinity_the_monad_called_free/ch2kly8</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell monads</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:eca573187dd8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:monads"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/23uzpg/lens_is_unidiomatic_haskell/ch0v5iw">
    <title>glguy comments on Lens is unidiomatic Haskell</title>
    <dc:date>2014-04-26T14:22:01+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/23uzpg/lens_is_unidiomatic_haskell/ch0v5iw</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell types</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:eca6691db149/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:types"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/23z5xb/lens_from_the_ground_up/ch24upg">
    <title>edwardkmett comments on Lens from the ground up</title>
    <dc:date>2014-04-26T13:05:20+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/23z5xb/lens_from_the_ground_up/ch24upg</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:830ada0c5651/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://stackoverflow.com/questions/23280936/how-do-experienced-haskell-developers-approach-laziness-at-design-time/23282122#23282122">
    <title>How do experienced Haskell developers approach laziness at *design* time? - Stack Overflow</title>
    <dc:date>2014-04-25T19:42:34+00:00</dc:date>
    <link>http://stackoverflow.com/questions/23280936/how-do-experienced-haskell-developers-approach-laziness-at-design-time/23282122#23282122</link>
    <dc:creator>marmolubio</dc:creator><description><![CDATA[Things take a special amount of care when you have codata that contains data. E.g. iterate (+1) 0 !! 1000 will end up producing a size-1000 thunk before evaluating it. ]]></description>
<dc:subject>haskell performance</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:b02432e9dd1b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:performance"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/23q8kc/wreq_a_capable_new_http_client_library/ch0dwku">
    <title>edwardkmett comments on wreq: a capable new HTTP client library</title>
    <dc:date>2014-04-24T06:11:00+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/23q8kc/wreq_a_capable_new_http_client_library/ch0dwku</link>
    <dc:creator>marmolubio</dc:creator><description><![CDATA[I learned practical applications of obscure bits of category theory, internalized the meaning of profunctors, proarrow equipments, framed bicategories, representability of profunctors, learned more about what kinds of adjoint functors are useful for getting stuff done, provided some interesting feedback to the rest of the bidirectional transformation community, figured out that uniplate is just a library supplying a traversal, and that I could steal its vocabulary, found connections between lenses and zippers that had been alluded to but not explored, found new ways to express breadth first traversals...]]></description>
<dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:b6bf9cd5228f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.diku.dk/~paba/pubs/entries/bahr13wgp.html">
    <title>Patrick Bahr - Programming macro tree transducers</title>
    <dc:date>2014-04-23T21:37:43+00:00</dc:date>
    <link>http://www.diku.dk/~paba/pubs/entries/bahr13wgp.html</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell algorithms</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:22448516a0cc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:algorithms"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://dev.stephendiehl.com/hask/">
    <title>What I Wish I Knew When Learning Haskell ( Stephen Diehl )</title>
    <dc:date>2014-04-23T21:14:49+00:00</dc:date>
    <link>http://dev.stephendiehl.com/hask/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell programming reference</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:2911814bf8d2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:reference"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.serpentine.com/wreq/">
    <title>wreq: a Haskell web client library</title>
    <dc:date>2014-04-23T06:26:37+00:00</dc:date>
    <link>http://www.serpentine.com/wreq/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell web http</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:da4d2096e16b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:web"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:http"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://typesandkinds.wordpress.com/2012/12/03/a-formalization-of-ghcs-core-language/">
    <title>A formalization of GHC’s core language | Types and Kinds</title>
    <dc:date>2014-04-22T20:43:56+00:00</dc:date>
    <link>http://typesandkinds.wordpress.com/2012/12/03/a-formalization-of-ghcs-core-language/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell ghc</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:e4649e95a2f9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:ghc"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://research.microsoft.com/en-us/um/people/simonpj/papers/ext-f/">
    <title>Simon Peyton Jones: papers</title>
    <dc:date>2014-04-22T20:36:03+00:00</dc:date>
    <link>http://research.microsoft.com/en-us/um/people/simonpj/papers/ext-f/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>ghc haskell types papers</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:c756c16e0088/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:ghc"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:types"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:papers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://ghc.haskell.org/trac/ghc/wiki/Commentary/Compiler/FC">
    <title>Commentary/Compiler/FC – GHC</title>
    <dc:date>2014-04-22T20:23:50+00:00</dc:date>
    <link>https://ghc.haskell.org/trac/ghc/wiki/Commentary/Compiler/FC</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell types</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:fef654a0a083/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:types"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/23i6ih/announcing_cabal_120/">
    <title>Announcing cabal 1.20 : haskell</title>
    <dc:date>2014-04-20T12:42:41+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/23i6ih/announcing_cabal_120/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>cabal haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:fce8bc0bbf5e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:cabal"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ro-che.info/articles/2014-04-20-json-validation-combinators.html">
    <title>JSON validation combinators</title>
    <dc:date>2014-04-20T07:41:26+00:00</dc:date>
    <link>http://ro-che.info/articles/2014-04-20-json-validation-combinators.html</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell json parsing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:ff7d3dfaad1e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:json"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:parsing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.rbjones.com/rbjpub/logic/cl/tlc001.htm">
    <title>Barendregt's Lambda Cube</title>
    <dc:date>2014-04-19T21:38:54+00:00</dc:date>
    <link>http://www.rbjones.com/rbjpub/logic/cl/tlc001.htm</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell logic math functional</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:ad065fbebbae/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:logic"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:math"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:functional"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://stackoverflow.com/questions/21219773/are-ghcs-type-famlies-an-example-of-system-f-omega">
    <title>haskell - Are GHC's Type Famlies An Example of System F-omega? - Stack Overflow</title>
    <dc:date>2014-04-19T19:23:22+00:00</dc:date>
    <link>http://stackoverflow.com/questions/21219773/are-ghcs-type-famlies-an-example-of-system-f-omega</link>
    <dc:creator>marmolubio</dc:creator><description><![CDATA[System F-omega allows universal quantification, abstraction and application at higher kinds, so not only over types (at kind *), but also at kinds k1 -> k2, where k1 and k2 are themselves kinds generated from * and ->. Hence, the type level itself becomes a simply typed lambda-calculus.

]]></description>
<dc:subject>haskell types ghc</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:d74f83e50213/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:types"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:ghc"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hackage.haskell.org/package/Omega-1.0.1">
    <title>Hackage: Omega: Integer sets and relations using Presburger arithmetic</title>
    <dc:date>2014-04-19T16:23:46+00:00</dc:date>
    <link>http://hackage.haskell.org/package/Omega-1.0.1</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:a923cada9391/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/23f138/finding_an_interesting_interface_for_simple_io_in/cgwda0l">
    <title>Tekmo comments on Finding an interesting interface for simple io in Haskell</title>
    <dc:date>2014-04-19T06:35:49+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/23f138/finding_an_interesting_interface_for_simple_io_in/cgwda0l</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:d4d3e7214b39/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.bham.ac.uk/~mhe/papers/realadt.pdf">
    <title>[untitled]</title>
    <dc:date>2014-04-18T16:23:42+00:00</dc:date>
    <link>http://www.cs.bham.ac.uk/~mhe/papers/realadt.pdf</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell types analysis</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:3178c9b24afb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:types"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:analysis"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.haskell.org/haskellwiki/index.php?title=Functor-Applicative-Monad_Proposal&amp;diff=57884&amp;oldid=57165">
    <title>Functor-Applicative-Monad Proposal - HaskellWiki</title>
    <dc:date>2014-04-16T21:15:51+00:00</dc:date>
    <link>http://www.haskell.org/haskellwiki/index.php?title=Functor-Applicative-Monad_Proposal&amp;diff=57884&amp;oldid=57165</link>
    <dc:creator>marmolubio</dc:creator><description><![CDATA[Prelude's sequence requres Monad right now, while Applicative is sufficient to implement it. The more general version of this issue is captured by Data.Traversable, whose main typeclass implements the *same* functionality twice, namely traverse and mapM, and sequenceA and sequence.
]]></description>
<dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:a9af167d9867/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://stackoverflow.com/questions/8963376/why-dont-type-synonyms-permit-recursion-in-haskell?rq=1">
    <title>Why don't type synonyms permit recursion in Haskell? - Stack Overflow</title>
    <dc:date>2014-04-16T20:23:24+00:00</dc:date>
    <link>http://stackoverflow.com/questions/8963376/why-dont-type-synonyms-permit-recursion-in-haskell?rq=1</link>
    <dc:creator>marmolubio</dc:creator><description><![CDATA[This has to do with Equi-recursive types versus iso-recursive types. Haskell implements recursive types using iso-recursive types, which require the programmer to tell the type-checker when type recursion is happening. The way you mark it is with a specific constructor, which a simple type-synonym doesn't allow you to have.

]]></description>
<dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:53c39ad0be23/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://jozefg.bitbucket.org/posts/2014-04-08-bargain-coroutines.html">
    <title>C&amp;C - Bargain Priced Coroutines</title>
    <dc:date>2014-04-16T18:35:50+00:00</dc:date>
    <link>http://jozefg.bitbucket.org/posts/2014-04-08-bargain-coroutines.html</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:3deb3cc668ed/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/2335mm/anyone_have_a_guide_to_reading_tapl/">
    <title>Anyone have a &quot;guide&quot; to reading TaPL? : haskell</title>
    <dc:date>2014-04-15T19:28:40+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/2335mm/anyone_have_a_guide_to_reading_tapl/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell types</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:ab9b5e8e3e12/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:types"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/2300zb/haskell_for_all_scalable_program_architectures/cgs77sw">
    <title>eruonna comments on Haskell for all: Scalable program architectures</title>
    <dc:date>2014-04-14T19:34:14+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/2300zb/haskell_for_all_scalable_program_architectures/cgs77sw</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:62a96de8242c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hackage.haskell.org/package/foldl-incremental-0.1.0.0">
    <title>Hackage: foldl-incremental: incremental folds</title>
    <dc:date>2014-04-14T06:34:11+00:00</dc:date>
    <link>http://hackage.haskell.org/package/foldl-incremental-0.1.0.0</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell libraries</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:a22f02f02456/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:libraries"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://groups.google.com/forum/#!msg/haskell-cafe/0Ebt6PJsd5o/a1tpyvNah98J">
    <title>[Haskell-cafe] warp vs scotty + some benchmark numbers - Google Groups</title>
    <dc:date>2014-04-13T11:04:54+00:00</dc:date>
    <link>https://groups.google.com/forum/#!msg/haskell-cafe/0Ebt6PJsd5o/a1tpyvNah98J</link>
    <dc:creator>marmolubio</dc:creator><description><![CDATA[If you're not running your Haskell program with "+RTS -A4M" (or for a newer chip even larger, the "4M" should correspond to the size of your L3 cache), please do so. The default of 512k is really too small for most processors in use and will force the runtime into garbage collection before the L3 cache is even consumed. In my benchmarks this flag alone can give you a remarkable improvement.
]]></description>
<dc:subject>haskell performance</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:655d3c842b60/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:performance"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://jeltsch.wordpress.com/2013/02/14/the-constraint-kind/">
    <title>The Constraint kind « Wolfgang Jeltsch</title>
    <dc:date>2014-04-12T02:12:31+00:00</dc:date>
    <link>http://jeltsch.wordpress.com/2013/02/14/the-constraint-kind/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell types</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:2017526d7cd7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:types"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://neilmitchell.blogspot.com.es/2010/12/installing-haskell-network-library-on.html">
    <title>Neil Mitchell's Haskell Blog: Installing the Haskell network library on Windows</title>
    <dc:date>2014-04-11T16:45:55+00:00</dc:date>
    <link>http://neilmitchell.blogspot.com.es/2010/12/installing-haskell-network-library-on.html</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell tips</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:24b57ca79644/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:tips"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hackage.haskell.org/package/free-functors-0.6.2">
    <title>Hackage: free-functors: Provides free functors that are adjoint to functors that forget class constraints.</title>
    <dc:date>2014-04-09T19:42:38+00:00</dc:date>
    <link>http://hackage.haskell.org/package/free-functors-0.6.2</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell libraries</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:0de1265d2a4a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:libraries"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/22ijq9/why_is_this_algorithm_so_much_slower_in_haskell/">
    <title>Why is this algorithm so much slower in Haskell than in C? : haskell</title>
    <dc:date>2014-04-08T22:23:54+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/22ijq9/why_is_this_algorithm_so_much_slower_in_haskell/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:d5af7eeb921a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://github.com/hvr/multi-ghc-travis">
    <title>hvr/multi-ghc-travis · GitHub</title>
    <dc:date>2014-04-08T21:58:11+00:00</dc:date>
    <link>https://github.com/hvr/multi-ghc-travis</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell cabal</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:777334b08ec9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:cabal"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hackage.haskell.org/package/packed-dawg">
    <title>Hackage: packed-dawg: Generation and traversal of highly compressed directed acyclic word graphs.</title>
    <dc:date>2014-04-08T21:57:12+00:00</dc:date>
    <link>http://hackage.haskell.org/package/packed-dawg</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell libraries</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:e5ad790242d9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:libraries"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.yesodweb.com/blog/2014/04/proposal-changes-pvp">
    <title>Proposal: Changes to the PVP</title>
    <dc:date>2014-04-08T20:14:09+00:00</dc:date>
    <link>http://www.yesodweb.com/blog/2014/04/proposal-changes-pvp</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:15f34dfabfac/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://skillsmatter.com/skillscasts/3932-a-haskell-lecture-with-leading-expert-andres-loh">
    <title>Skills Matter</title>
    <dc:date>2014-04-07T06:21:29+00:00</dc:date>
    <link>https://skillsmatter.com/skillscasts/3932-a-haskell-lecture-with-leading-expert-andres-loh</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell lecture video</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:fd0f375bfba7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:lecture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:video"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/22bm10/haskell_usage_in_the_real_world/cglakvz">
    <title>quinta_essentia comments on Haskell usage in the real world...</title>
    <dc:date>2014-04-06T13:35:22+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/22bm10/haskell_usage_in_the_real_world/cglakvz</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:9c6d118d2751/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hackage.haskell.org/package/temporary-1.2.0.2">
    <title>Hackage: temporary: Portable temporary file and directory support for Windows and Unix, based on code from Cabal</title>
    <dc:date>2014-04-05T12:09:10+00:00</dc:date>
    <link>http://hackage.haskell.org/package/temporary-1.2.0.2</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell libraries windows</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:da92746f8779/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:libraries"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:windows"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://conal.net/talks/elegant-memoization.pdf">
    <title>[untitled]</title>
    <dc:date>2014-04-05T02:01:05+00:00</dc:date>
    <link>http://conal.net/talks/elegant-memoization.pdf</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:1743ba60b320/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.scs.stanford.edu/14sp-cs240h/slides/basics-slides.html#(53)">
    <title>(53)</title>
    <dc:date>2014-04-04T14:25:49+00:00</dc:date>
    <link>http://www.scs.stanford.edu/14sp-cs240h/slides/basics-slides.html#(53)</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell slides</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:75d5224f7439/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:slides"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.fpcomplete.com/school/to-infinity-and-beyond/pick-of-the-week/guide-to-ghc-extensions/basic-syntax-extensions#multiwayif">
    <title>Basic Syntax Extensions - School of Haskell | FP Complete</title>
    <dc:date>2014-04-03T20:14:46+00:00</dc:date>
    <link>https://www.fpcomplete.com/school/to-infinity-and-beyond/pick-of-the-week/guide-to-ghc-extensions/basic-syntax-extensions#multiwayif</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:8cee06b3a38d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hackage.haskell.org/package/optparse-applicative-0.8.0.1/changelog">
    <title>[untitled]</title>
    <dc:date>2014-04-02T22:51:39+00:00</dc:date>
    <link>http://hackage.haskell.org/package/optparse-applicative-0.8.0.1/changelog</link>
    <dc:creator>marmolubio</dc:creator><description><![CDATA[- Deprecated `arguments` and `arguments1` builders. Using `many` and `some` on a
  parser built using `argument` now returns a multiple argument parsers that
  behaves correctly with respect to `--`.]]></description>
<dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:5e14082ac918/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://neilmitchell.blogspot.com.es/2014/04/exceptional-testing.html">
    <title>Neil Mitchell's Haskell Blog: Exceptional Testing</title>
    <dc:date>2014-04-01T21:52:36+00:00</dc:date>
    <link>http://neilmitchell.blogspot.com.es/2014/04/exceptional-testing.html</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:a9578a6b6a79/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hackage.haskell.org/package/snap-loader-dynamic-0.10.0.1/docs/Snap-Loader-Dynamic.html">
    <title>Snap.Loader.Dynamic</title>
    <dc:date>2014-04-01T20:13:28+00:00</dc:date>
    <link>http://hackage.haskell.org/package/snap-loader-dynamic-0.10.0.1/docs/Snap-Loader-Dynamic.html</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell libraries tips</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:b79d9d144245/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:libraries"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:tips"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/21tusc/writing_a_simple_type_checker_with_bound/cgggjyt">
    <title>tel comments on Writing a simple type checker with Bound</title>
    <dc:date>2014-03-31T20:30:35+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/21tusc/writing_a_simple_type_checker_with_bound/cgggjyt</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:0af790dbce67/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reddit.com/r/haskell/comments/21tusc/writing_a_simple_type_checker_with_bound/">
    <title>Writing a simple type checker with Bound : haskell</title>
    <dc:date>2014-03-31T20:29:52+00:00</dc:date>
    <link>http://www.reddit.com/r/haskell/comments/21tusc/writing_a_simple_type_checker_with_bound/</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>compilers haskell libraries</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:f0743ebb3647/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:compilers"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:libraries"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.haskell.org/ghc/docs/7.8.1-rc2/html/users_guide/flag-reference.html#idp14537440">
    <title>4.20. Flag reference</title>
    <dc:date>2014-03-30T21:47:51+00:00</dc:date>
    <link>http://www.haskell.org/ghc/docs/7.8.1-rc2/html/users_guide/flag-reference.html#idp14537440</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell libraries</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:0487ee6fd7fa/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:libraries"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hackage.haskell.org/package/base-4.6.0.1/docs/Data-Data.html#v:gfoldl">
    <title>Data.Data</title>
    <dc:date>2014-03-30T21:40:40+00:00</dc:date>
    <link>http://hackage.haskell.org/package/base-4.6.0.1/docs/Data-Data.html#v:gfoldl</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:b0ef203c8dce/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://curtis.io/posts/generating-data-uris-with-haskell.html">
    <title>Curtis Gagliardi</title>
    <dc:date>2014-03-30T08:51:15+00:00</dc:date>
    <link>http://curtis.io/posts/generating-data-uris-with-haskell.html</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:d6c220a7d5ae/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://hackage.haskell.org/package/combinat-0.2.5.0">
    <title>Hackage: combinat: Generation of various combinatorial objects.</title>
    <dc:date>2014-03-29T20:54:47+00:00</dc:date>
    <link>http://hackage.haskell.org/package/combinat-0.2.5.0</link>
    <dc:creator>marmolubio</dc:creator><dc:subject>haskell combinatorics libraries</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:marmolubio/b:7006e295363b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:marmolubio/t:libraries"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>