<?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/tag/haskell"><title>BibSonomy bookmarks for /tag/haskell</title><link>https://www.bibsonomy.org/tag/haskell</link><description>BibSonomy RSS Feed for /tag/haskell</description><items><rdf:Seq><rdf:li rdf:resource="https://iagoleal.com/posts/automata-monads/"/><rdf:li rdf:resource="https://web.archive.org/web/20211014094900/https://ren.zone/articles/safe-money"/><rdf:li rdf:resource="https://cdsmithus.medium.com/pair-programming-with-chatgpt-haskell-1c4490b71da6"/><rdf:li rdf:resource="https://wasp-lang.dev/blog/2021/09/01/haskell-forall-tutorial"/><rdf:li rdf:resource="https://algebradriven.design/"/><rdf:li rdf:resource="https://medium.com/pragmatic-programmers/pure-print-style-debugging-in-haskell-c4c5d4f39afa"/><rdf:li rdf:resource="http://conal.net/papers/type-class-morphisms/"/><rdf:li rdf:resource="https://github.com/bolt12/advent-of-haskell-dd"/><rdf:li rdf:resource="https://duplode.github.io/posts/divisible-and-the-monoidal-quartet.html"/><rdf:li rdf:resource="http://learnyouanagda.liamoc.net/pages/introduction.html"/><rdf:li rdf:resource="https://gist.github.com/beala/d871ae8397167e7035f218a25ddf87dd"/><rdf:li rdf:resource="https://ghc.readthedocs.io/en/8.0.1/debug-info.html"/><rdf:li rdf:resource="https://kowainik.github.io/posts/haskell-mini-patterns"/><rdf:li rdf:resource="https://doisinkidney.com/posts/2019-12-14-stern-brocot.html"/><rdf:li rdf:resource="https://doisinkidney.com/posts/2019-12-14-stern-brocot.html"/><rdf:li rdf:resource="http://www.michaelburge.us/2017/08/25/writing-a-formally-verified-porn-browser-in-coq.html"/><rdf:li rdf:resource="https://wiki.haskell.org/Implement_a_chat_server"/><rdf:li rdf:resource="https://lexi-lambda.github.io/blog/2018/02/10/an-opinionated-guide-to-haskell-in-2018/"/><rdf:li rdf:resource="https://www.tweag.io/posts/2019-10-09-bazel-cabal-stack.html"/><rdf:li rdf:resource="https://www.tpflug.me/2019/01/14/haskell-nix-vim/"/></rdf:Seq></items></channel><item rdf:about="https://iagoleal.com/posts/automata-monads/"><title>A Fistful of Automata | Iago Leal</title><description></description><link>https://iagoleal.com/posts/automata-monads/</link><dc:creator>bshanks</dc:creator><dc:date>2023-11-08T21:44:09+01:00</dc:date><dc:subject>automata dfa haskell monad nfa </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2023-11-08T21:44:09+01:00&#034; href=&#034;https://iagoleal.com/posts/automata-monads/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://iagoleal.com/posts/automata-monads/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/automata"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dfa"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/monad"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/nfa"/></rdf:Bag></taxo:topics></item><item rdf:about="https://web.archive.org/web/20211014094900/https://ren.zone/articles/safe-money"><title>safe-money: Money in the type system where it belongs</title><description></description><link>https://web.archive.org/web/20211014094900/https://ren.zone/articles/safe-money</link><dc:creator>bshanks</dc:creator><dc:date>2023-09-19T19:39:23+02:00</dc:date><dc:subject>haskell money </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2023-09-19T19:39:23+02:00&#034; href=&#034;https://web.archive.org/web/20211014094900/https://ren.zone/articles/safe-money&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://web.archive.org/web/20211014094900/https://ren.zone/articles/safe-money&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/money"/></rdf:Bag></taxo:topics></item><item rdf:about="https://cdsmithus.medium.com/pair-programming-with-chatgpt-haskell-1c4490b71da6"><title>Pair Programming with ChatGPT &amp; Haskell | by Chris Smith | Jan, 2023 | Medium</title><description></description><link>https://cdsmithus.medium.com/pair-programming-with-chatgpt-haskell-1c4490b71da6</link><dc:creator>bshanks</dc:creator><dc:date>2023-01-27T07:16:03+01:00</dc:date><dc:subject>ai code gpt haskell program </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2023-01-27T07:16:03+01:00&#034; href=&#034;https://cdsmithus.medium.com/pair-programming-with-chatgpt-haskell-1c4490b71da6&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://cdsmithus.medium.com/pair-programming-with-chatgpt-haskell-1c4490b71da6&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ai"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/code"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/gpt"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/program"/></rdf:Bag></taxo:topics></item><item rdf:about="https://wasp-lang.dev/blog/2021/09/01/haskell-forall-tutorial"><title>Tutorial: `forall` in Haskell | Wasp</title><description></description><link>https://wasp-lang.dev/blog/2021/09/01/haskell-forall-tutorial</link><dc:creator>bshanks</dc:creator><dc:date>2022-12-08T08:35:06+01:00</dc:date><dc:subject>forall haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-12-08T08:35:06+01:00&#034; href=&#034;https://wasp-lang.dev/blog/2021/09/01/haskell-forall-tutorial&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://wasp-lang.dev/blog/2021/09/01/haskell-forall-tutorial&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/forall"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="https://algebradriven.design/"><title>Algebra-Driven Design: Elegant Software from Simple Building Blocks</title><description></description><link>https://algebradriven.design/</link><dc:creator>bshanks</dc:creator><dc:date>2022-08-21T06:49:27+02:00</dc:date><dc:subject>algebra equation haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-08-21T06:49:27+02:00&#034; href=&#034;https://algebradriven.design/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://algebradriven.design/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algebra"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/equation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="https://medium.com/pragmatic-programmers/pure-print-style-debugging-in-haskell-c4c5d4f39afa"><title>Pure Print-Style Debugging in Haskell | by Rebecca Skinner | The Pragmatic Programmers | Mar, 2022 | Medium</title><description></description><link>https://medium.com/pragmatic-programmers/pure-print-style-debugging-in-haskell-c4c5d4f39afa</link><dc:creator>bshanks</dc:creator><dc:date>2022-03-31T04:22:51+02:00</dc:date><dc:subject>debug haskell print printf </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-03-31T04:22:51+02:00&#034; href=&#034;https://medium.com/pragmatic-programmers/pure-print-style-debugging-in-haskell-c4c5d4f39afa&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://medium.com/pragmatic-programmers/pure-print-style-debugging-in-haskell-c4c5d4f39afa&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/debug"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/print"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/printf"/></rdf:Bag></taxo:topics></item><item rdf:about="http://conal.net/papers/type-class-morphisms/"><title>Denotational design with type class morphisms</title><description></description><link>http://conal.net/papers/type-class-morphisms/</link><dc:creator>bshanks</dc:creator><dc:date>2022-01-03T06:37:24+01:00</dc:date><dc:subject>denotationaldesign formal haskell proof </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-01-03T06:37:24+01:00&#034; href=&#034;http://conal.net/papers/type-class-morphisms/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://conal.net/papers/type-class-morphisms/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/denotationaldesign"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/formal"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/proof"/></rdf:Bag></taxo:topics></item><item rdf:about="https://github.com/bolt12/advent-of-haskell-dd"><title>bolt12/advent-of-haskell-dd: Day 9 of Advent of Haskell - Denotational Design</title><description></description><link>https://github.com/bolt12/advent-of-haskell-dd</link><dc:creator>bshanks</dc:creator><dc:date>2022-01-03T06:36:08+01:00</dc:date><dc:subject>denotationaldesign formal haskell proof </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-01-03T06:36:08+01:00&#034; href=&#034;https://github.com/bolt12/advent-of-haskell-dd&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://github.com/bolt12/advent-of-haskell-dd&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/denotationaldesign"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/formal"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/proof"/></rdf:Bag></taxo:topics></item><item rdf:about="https://duplode.github.io/posts/divisible-and-the-monoidal-quartet.html"><title>Divisible and the Monoidal Quartet - The Life Monadic</title><description></description><link>https://duplode.github.io/posts/divisible-and-the-monoidal-quartet.html</link><dc:creator>gdmcbain</dc:creator><dc:date>2021-11-18T21:44:05+01:00</dc:date><dc:subject>68n18-functional-programming-and-lambda-calculus haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-11-18T21:44:05+01:00&#034; href=&#034;https://duplode.github.io/posts/divisible-and-the-monoidal-quartet.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://duplode.github.io/posts/divisible-and-the-monoidal-quartet.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/68n18-functional-programming-and-lambda-calculus"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="http://learnyouanagda.liamoc.net/pages/introduction.html"><title>Learn You An Agda - Introduction</title><description></description><link>http://learnyouanagda.liamoc.net/pages/introduction.html</link><dc:creator>gdmcbain</dc:creator><dc:date>2021-08-30T02:39:04+02:00</dc:date><dc:subject>03b15-higher-order-logic-type-theory 68n18-functional-programming-and-lambda-calculus agda haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2021-08-30T02:39:04+02:00&#034; href=&#034;http://learnyouanagda.liamoc.net/pages/introduction.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://learnyouanagda.liamoc.net/pages/introduction.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/03b15-higher-order-logic-type-theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/68n18-functional-programming-and-lambda-calculus"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/agda"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="https://gist.github.com/beala/d871ae8397167e7035f218a25ddf87dd"><title>Elegant memoization in Haskell with laziness. · GitHub</title><description></description><link>https://gist.github.com/beala/d871ae8397167e7035f218a25ddf87dd</link><dc:creator>mkf</dc:creator><dc:date>2020-09-21T10:14:02+02:00</dc:date><dc:subject>haskell haskell_memoization </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-09-21T10:14:02+02:00&#034; href=&#034;https://gist.github.com/beala/d871ae8397167e7035f218a25ddf87dd&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://gist.github.com/beala/d871ae8397167e7035f218a25ddf87dd&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell_memoization"/></rdf:Bag></taxo:topics></item><item rdf:about="https://ghc.readthedocs.io/en/8.0.1/debug-info.html"><title>13. Debugging compiled programs — Glasgow Haskell Compiler &lt;release&gt; Users Guide</title><description></description><link>https://ghc.readthedocs.io/en/8.0.1/debug-info.html</link><dc:creator>mkf</dc:creator><dc:date>2020-09-21T10:12:28+02:00</dc:date><dc:subject>haskell haskell_debugging </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-09-21T10:12:28+02:00&#034; href=&#034;https://ghc.readthedocs.io/en/8.0.1/debug-info.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://ghc.readthedocs.io/en/8.0.1/debug-info.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell_debugging"/></rdf:Bag></taxo:topics></item><item rdf:about="https://kowainik.github.io/posts/haskell-mini-patterns"><title>Haskell mini-patterns handbook :: Kowainik</title><description></description><link>https://kowainik.github.io/posts/haskell-mini-patterns</link><dc:creator>bshanks</dc:creator><dc:date>2020-08-19T15:01:14+02:00</dc:date><dc:subject>haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2020-08-19T15:01:14+02:00&#034; href=&#034;https://kowainik.github.io/posts/haskell-mini-patterns&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://kowainik.github.io/posts/haskell-mini-patterns&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="https://doisinkidney.com/posts/2019-12-14-stern-brocot.html"><title>Lazy Constructive Numbers and the Stern-Brocot Tree - Donnacha Oisín Kidney</title><description></description><link>https://doisinkidney.com/posts/2019-12-14-stern-brocot.html</link><dc:creator>analyst</dc:creator><dc:date>2019-12-20T10:20:59+01:00</dc:date><dc:subject>article blog haskell number-theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-12-20T10:20:59+01:00&#034; href=&#034;https://doisinkidney.com/posts/2019-12-14-stern-brocot.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://doisinkidney.com/posts/2019-12-14-stern-brocot.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/article"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/number-theory"/></rdf:Bag></taxo:topics></item><item rdf:about="https://doisinkidney.com/posts/2019-12-14-stern-brocot.html"><title>Lazy Constructive Numbers and the Stern-Brocot Tree - Donnacha Oisín Kidney</title><description></description><link>https://doisinkidney.com/posts/2019-12-14-stern-brocot.html</link><dc:creator>gdmcbain</dc:creator><dc:date>2019-12-19T19:08:32+01:00</dc:date><dc:subject>03f60-constructive-and-recursive-analysis Agra Haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-12-19T19:08:32+01:00&#034; href=&#034;https://doisinkidney.com/posts/2019-12-14-stern-brocot.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://doisinkidney.com/posts/2019-12-14-stern-brocot.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/03f60-constructive-and-recursive-analysis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Agra"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.michaelburge.us/2017/08/25/writing-a-formally-verified-porn-browser-in-coq.html"><title>Writing a Formally-Verified Porn Browser in Coq and Haskell</title><description></description><link>http://www.michaelburge.us/2017/08/25/writing-a-formally-verified-porn-browser-in-coq.html</link><dc:creator>mkf</dc:creator><dc:date>2019-12-17T17:08:15+01:00</dc:date><dc:subject>coq coq-extraction-haskell haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-12-17T17:08:15+01:00&#034; href=&#034;http://www.michaelburge.us/2017/08/25/writing-a-formally-verified-porn-browser-in-coq.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.michaelburge.us/2017/08/25/writing-a-formally-verified-porn-browser-in-coq.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/coq"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/coq-extraction-haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="https://wiki.haskell.org/Implement_a_chat_server"><title>Implement a chat server - HaskellWiki</title><description></description><link>https://wiki.haskell.org/Implement_a_chat_server</link><dc:creator>mkf</dc:creator><dc:date>2019-11-26T08:36:10+01:00</dc:date><dc:subject>haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-11-26T08:36:10+01:00&#034; href=&#034;https://wiki.haskell.org/Implement_a_chat_server&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://wiki.haskell.org/Implement_a_chat_server&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="https://lexi-lambda.github.io/blog/2018/02/10/an-opinionated-guide-to-haskell-in-2018/"><title>An opinionated guide to Haskell in 2018</title><description>For me, this month marks the end of an era in my life: as of February 2018, I am no longer employed writing Haskell. It’s been a fascinating two years, and while I am excitedly looking forward to what I’ll be doing next, it’s likely I will continue to wri...</description><link>https://lexi-lambda.github.io/blog/2018/02/10/an-opinionated-guide-to-haskell-in-2018/</link><dc:creator>mkf</dc:creator><dc:date>2019-11-26T08:02:29+01:00</dc:date><dc:subject>cabal haskell stack </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;For me, this month marks the end of an era in my life: as of February 2018, I am no longer employed writing Haskell. It’s been a fascinating two years, and while I am excitedly looking forward to what I’ll be doing next, it’s likely I will continue to wri...&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cabal"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stack"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.tweag.io/posts/2019-10-09-bazel-cabal-stack.html"><title>Tweag I/O - Bazel, Cabal, Stack: Why choose when you can have them all?</title><description></description><link>https://www.tweag.io/posts/2019-10-09-bazel-cabal-stack.html</link><dc:creator>mkf</dc:creator><dc:date>2019-11-26T08:02:06+01:00</dc:date><dc:subject>cabal haskell stack </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-11-26T08:02:06+01:00&#034; href=&#034;https://www.tweag.io/posts/2019-10-09-bazel-cabal-stack.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.tweag.io/posts/2019-10-09-bazel-cabal-stack.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cabal"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stack"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.tpflug.me/2019/01/14/haskell-nix-vim/"><title>Haskell, Nix and Vim: Getting started · tblog</title><description></description><link>https://www.tpflug.me/2019/01/14/haskell-nix-vim/</link><dc:creator>mkf</dc:creator><dc:date>2019-11-26T08:01:05+01:00</dc:date><dc:subject>cabal haskell nix </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2019-11-26T08:01:05+01:00&#034; href=&#034;https://www.tpflug.me/2019/01/14/haskell-nix-vim/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.tpflug.me/2019/01/14/haskell-nix-vim/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cabal"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/nix"/></rdf:Bag></taxo:topics></item></rdf:RDF>