<?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/frp"><title>BibSonomy bookmarks for /user/draganigajic/frp</title><link>https://www.bibsonomy.org/user/draganigajic/frp</link><description>BibSonomy RSS Feed for /user/draganigajic/frp</description><items><rdf:Seq><rdf:li rdf:resource="http://www.flapjax-lang.org/docs/"/><rdf:li rdf:resource="http://www.flapjax-lang.org/demos/delicious/1/j.txt"/><rdf:li rdf:resource="http://lmeyerov.blogspot.com/"/><rdf:li rdf:resource="http://www.cs.yale.edu/homes/hudak-paul/"/><rdf:li rdf:resource="http://lambda-the-ultimate.org/node/2906"/><rdf:li rdf:resource="http://conal.net/blog/posts/future-values/"/><rdf:li rdf:resource="http://anygma.com/TheCompany.html"/><rdf:li rdf:resource="http://www.haskell.org/haskellwiki/Grapefruit"/><rdf:li rdf:resource="http://conal.net/blog/posts/simplifying-semantics-with-type-class-morphisms/"/><rdf:li rdf:resource="http://conal.net/Pajama/"/><rdf:li rdf:resource="http://www.lilyapp.org/"/><rdf:li rdf:resource="http://conal.net/papers/simply-reactive/"/><rdf:li rdf:resource="http://lindstroem.wordpress.com/"/><rdf:li rdf:resource="http://abstractabsurd.blogspot.com/2008/09/some-first-steps-with-datareactive.html"/><rdf:li rdf:resource="http://www.timber-lang.org/index_gentle.html"/><rdf:li rdf:resource="http://groups.google.com/group/fa.haskell/browse_thread/thread/6c68eea734310b4b?pli=1"/><rdf:li rdf:resource="http://tomasp.net/blog/reactive-ii-csevents.aspx"/><rdf:li rdf:resource="http://lukepalmer.wordpress.com/2008/12/29/continuous-stream-fusion/"/><rdf:li rdf:resource="http://netsuperbrain.com/blog/posts/category/reactive-tutorials/"/><rdf:li rdf:resource="http://www.reddit.com/r/programming/related/68xkq/frp_game_library_an_introduction_to_functional/"/></rdf:Seq></items></channel><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.flapjax-lang.org/demos/delicious/1/j.txt"><title>http://www.flapjax-lang.org/demos/delicious/1/j.txt</title><description></description><link>http://www.flapjax-lang.org/demos/delicious/1/j.txt</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:49+02:00</dc:date><dc:subject>demo flapjax frp javascript webdev </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:49+02:00&#034; href=&#034;http://www.flapjax-lang.org/demos/delicious/1/j.txt&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.flapjax-lang.org/demos/delicious/1/j.txt&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/demo"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/flapjax"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/javascript"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/webdev"/></rdf:Bag></taxo:topics></item><item rdf:about="http://lmeyerov.blogspot.com/"><title>The Good Soldier LMeyerov</title><description></description><link>http://lmeyerov.blogspot.com/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:13+02:00</dc:date><dc:subject>0 berkeley blog flapjax fp frp people </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:13+02:00&#034; href=&#034;http://lmeyerov.blogspot.com/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://lmeyerov.blogspot.com/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/0"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/berkeley"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/flapjax"/><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/people"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.yale.edu/homes/hudak-paul/"><title>Professor Paul Hudak&#039;s Home Page</title><description></description><link>http://www.cs.yale.edu/homes/hudak-paul/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:11+02:00</dc:date><dc:subject>bio fp frp haskell people programming </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:11+02:00&#034; href=&#034;http://www.cs.yale.edu/homes/hudak-paul/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.yale.edu/homes/hudak-paul/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bio"/><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/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/people"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://lambda-the-ultimate.org/node/2906"><title>Functional reactive programming in C# for WPF | Lambda the Ultimate</title><description></description><link>http://lambda-the-ultimate.org/node/2906</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:09+02:00</dc:date><dc:subject>0 c# dotnet frp ltu </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:09+02:00&#034; href=&#034;http://lambda-the-ultimate.org/node/2906&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://lambda-the-ultimate.org/node/2906&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/0"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/c#"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dotnet"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ltu"/></rdf:Bag></taxo:topics></item><item rdf:about="http://conal.net/blog/posts/future-values/"><title>Conal Elliott » Future values</title><description></description><link>http://conal.net/blog/posts/future-values/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:09+02:00</dc:date><dc:subject>FRP blogpost conalElliot concurrency cs fp future haskell programming </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:09+02:00&#034; href=&#034;http://conal.net/blog/posts/future-values/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://conal.net/blog/posts/future-values/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/FRP"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blogpost"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/conalElliot"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/concurrency"/><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/future"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://anygma.com/TheCompany.html"><title>Anygma</title><description>belgian company see luqui.org</description><link>http://anygma.com/TheCompany.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:06+02:00</dc:date><dc:subject>0 conalElliot frp haskell jobs luqui </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;belgian company see luqui.org&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/0"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/conalElliot"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/jobs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/luqui"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.haskell.org/haskellwiki/Grapefruit"><title>Grapefruit - HaskellWiki</title><description></description><link>http://www.haskell.org/haskellwiki/Grapefruit</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:02+02:00</dc:date><dc:subject>from:realsplog frp gui haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:02+02:00&#034; href=&#034;http://www.haskell.org/haskellwiki/Grapefruit&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.haskell.org/haskellwiki/Grapefruit&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/from:realsplog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/gui"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="http://conal.net/blog/posts/simplifying-semantics-with-type-class-morphisms/"><title>Conal Elliott  Simplifying semantics with type class morphisms</title><description></description><link>http://conal.net/blog/posts/simplifying-semantics-with-type-class-morphisms/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:50+02:00</dc:date><dc:subject>*RIL *read blogpost categoryTheory conalElliot frp haskell morphism tutorial typeTheory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:50+02:00&#034; href=&#034;http://conal.net/blog/posts/simplifying-semantics-with-type-class-morphisms/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://conal.net/blog/posts/simplifying-semantics-with-type-class-morphisms/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*RIL"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*read"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blogpost"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/categoryTheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/conalElliot"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/morphism"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/typeTheory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://conal.net/Pajama/"><title>Pajama</title><description></description><link>http://conal.net/Pajama/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:50+02:00</dc:date><dc:subject>conalElliot demo fp frp graphics </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:50+02:00&#034; href=&#034;http://conal.net/Pajama/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://conal.net/Pajama/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/conalElliot"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/demo"/><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/graphics"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.lilyapp.org/"><title>Lily | Visual Programming for the Mozilla Framework</title><description></description><link>http://www.lilyapp.org/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:48+02:00</dc:date><dc:subject>*RIL *read firefox framework frp javascript lily programming visual visualization web2.0 webdev </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:48+02:00&#034; href=&#034;http://www.lilyapp.org/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.lilyapp.org/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*RIL"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*read"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/firefox"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/framework"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/javascript"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lily"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/visual"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/visualization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/web2.0"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/webdev"/></rdf:Bag></taxo:topics></item><item rdf:about="http://conal.net/papers/simply-reactive/"><title>Simply efficient functional reactivity</title><description></description><link>http://conal.net/papers/simply-reactive/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:41+02:00</dc:date><dc:subject>conalElliot frp haskell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:41+02:00&#034; href=&#034;http://conal.net/papers/simply-reactive/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://conal.net/papers/simply-reactive/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/conalElliot"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="http://lindstroem.wordpress.com/"><title>Haskellville</title><description></description><link>http://lindstroem.wordpress.com/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:39+02:00</dc:date><dc:subject>*RIL *read blog frp generic gui haskell wx </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:39+02:00&#034; href=&#034;http://lindstroem.wordpress.com/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://lindstroem.wordpress.com/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*RIL"/><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/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/generic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/gui"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wx"/></rdf:Bag></taxo:topics></item><item rdf:about="http://abstractabsurd.blogspot.com/2008/09/some-first-steps-with-datareactive.html"><title>Abstract Absurdities: Some first steps with Data.Reactive</title><description></description><link>http://abstractabsurd.blogspot.com/2008/09/some-first-steps-with-datareactive.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:30+02:00</dc:date><dc:subject>blogpost dataflow example frp haskell reactive </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:30+02:00&#034; href=&#034;http://abstractabsurd.blogspot.com/2008/09/some-first-steps-with-datareactive.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://abstractabsurd.blogspot.com/2008/09/some-first-steps-with-datareactive.html&lt;/a&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/dataflow"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/example"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/reactive"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.timber-lang.org/index_gentle.html"><title>Timber intro</title><description>Timber program reacts to events sent to it from its execution environment. This process is potentially infinite, and the order of external events is not known in advance.To capture this intuition, Timber defines its primary run-time structure to be a set of interconnected reactive objects, that each encapsulate a piece of the global program state. A reactive object is a passive entity defined by a set of methods. Between invocations, a Timber object just maintains its state, ready to react . Timber objects evolve in parallel, although the methods belonging to a particular object are always run under mutually exclusion. Concurrency as well as state protection is thus implicit. Methods are either asynchronous or synchronous, as denoted by the keywords action and request, respectively. The most radical property of Timber is that it is free from any indefinitely blocking constructs; because of this, a Timber object is always fully responsive when not actively executing code.</description><link>http://www.timber-lang.org/index_gentle.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:23+02:00</dc:date><dc:subject>frp haskell oo reactive timber </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Timber program reacts to events sent to it from its execution environment. This process is potentially infinite, and the order of external events is not known in advance.To capture this intuition, Timber defines its primary run-time structure to be a set of interconnected reactive objects, that each encapsulate a piece of the global program state. A reactive object is a passive entity defined by a set of methods. Between invocations, a Timber object just maintains its state, ready to react . Timber objects evolve in parallel, although the methods belonging to a particular object are always run under mutually exclusion. Concurrency as well as state protection is thus implicit. Methods are either asynchronous or synchronous, as denoted by the keywords action and request, respectively. The most radical property of Timber is that it is free from any indefinitely blocking constructs; because of this, a Timber object is always fully responsive when not actively executing code.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/oo"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/reactive"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/timber"/></rdf:Bag></taxo:topics></item><item rdf:about="http://groups.google.com/group/fa.haskell/browse_thread/thread/6c68eea734310b4b?pli=1"><title>yampa v reactive comparison</title><description>henrik nilsson</description><link>http://groups.google.com/group/fa.haskell/browse_thread/thread/6c68eea734310b4b?pli=1</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:16+02:00</dc:date><dc:subject>discussion frp haskell </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;henrik nilsson&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/discussion"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/></rdf:Bag></taxo:topics></item><item rdf:about="http://tomasp.net/blog/reactive-ii-csevents.aspx"><title>Reactive programming (II.) - Introducing Reactive LINQ | Blog | TomasP.Net</title><description>Reactive programming (II.) - Introducing Reactive LINQ  In this article I&#039;m going to introduce my project Reactive LINQ. This is largely inspired by the ideas that come from functional reactive programming in the Haskell language and from functionality that&#039;s available for working in events in F#. I introduced these ideas in my previous article in this mini-series, so if you&#039;re interested in learning more about these interesting technologies, you should definitely read the previous article about First class events in F#.  In this article, we&#039;re going to look how to apply the same ideas to the C# language and how to use LINQ queries for processing events. This article is just another my article that shows how to implement some idea from functional programming in C#. I believe this will once again show that the new features in the C# 3.0 aren&#039;t just about querying databases The idea: Event is a stream</description><link>http://tomasp.net/blog/reactive-ii-csevents.aspx</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:15+02:00</dc:date><dc:subject>C# blogpost frp linq reactive </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Reactive programming (II.) - Introducing Reactive LINQ  In this article I&amp;#039;m going to introduce my project Reactive LINQ. This is largely inspired by the ideas that come from functional reactive programming in the Haskell language and from functionality that&amp;#039;s available for working in events in F#. I introduced these ideas in my previous article in this mini-series, so if you&amp;#039;re interested in learning more about these interesting technologies, you should definitely read the previous article about First class events in F#.  In this article, we&amp;#039;re going to look how to apply the same ideas to the C# language and how to use LINQ queries for processing events. This article is just another my article that shows how to implement some idea from functional programming in C#. I believe this will once again show that the new features in the C# 3.0 aren&amp;#039;t just about querying databases The idea: Event is a stream&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/C#"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blogpost"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/linq"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/reactive"/></rdf:Bag></taxo:topics></item><item rdf:about="http://lukepalmer.wordpress.com/2008/12/29/continuous-stream-fusion/"><title>continuous stram fusion</title><description>I’ve been able to sketch-implement a version of FRP with a strange distinction: Env vs. Behavior. I’ll give you the intuition, then the rest of the article will develop the semantics more fully. I thought “backwards” to discover this (the word “discover” used under the assumption that it has some merit: questionable), from implementation, to concept, to semantics. The semantics of Env a are plain ol’ Time -&gt; a, but with a caveat: there is no reactivity allowed. I.e. an Env a yields an a only by looking at stuff “now”. In the implementation, this is just a subtype of IO. The semantics of Behavior are even less defined. I guess it’s semantics are Time -&gt; Time -&gt; a, so it is given a “start time” and returns a time function. It’s sortof like a relative behavior, but shifting it around does not exactly preserve behavior. The implementation is much like Reactive (Env a), where Reactive is from the popular reactive library.</description><link>http://lukepalmer.wordpress.com/2008/12/29/continuous-stream-fusion/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:15+02:00</dc:date><dc:subject>blogpost frp </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;I’ve been able to sketch-implement a version of FRP with a strange distinction: Env vs. Behavior. I’ll give you the intuition, then the rest of the article will develop the semantics more fully. I thought “backwards” to discover this (the word “discover” used under the assumption that it has some merit: questionable), from implementation, to concept, to semantics. The semantics of Env a are plain ol’ Time -&amp;gt; a, but with a caveat: there is no reactivity allowed. I.e. an Env a yields an a only by looking at stuff “now”. In the implementation, this is just a subtype of IO. The semantics of Behavior are even less defined. I guess it’s semantics are Time -&amp;gt; Time -&amp;gt; a, so it is given a “start time” and returns a time function. It’s sortof like a relative behavior, but shifting it around does not exactly preserve behavior. The implementation is much like Reactive (Env a), where Reactive is from the popular reactive library.&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/frp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://netsuperbrain.com/blog/posts/category/reactive-tutorials/"><title>Less Sugar/More Meat</title><description></description><link>http://netsuperbrain.com/blog/posts/category/reactive-tutorials/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:15+02:00</dc:date><dc:subject>frp haskell reactive tutorials </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:15+02:00&#034; href=&#034;http://netsuperbrain.com/blog/posts/category/reactive-tutorials/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://netsuperbrain.com/blog/posts/category/reactive-tutorials/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/reactive"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorials"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.reddit.com/r/programming/related/68xkq/frp_game_library_an_introduction_to_functional/"><title>/frp_game_library_an_introduction_to_functional/</title><description></description><link>http://www.reddit.com/r/programming/related/68xkq/frp_game_library_an_introduction_to_functional/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:12:15+02:00</dc:date><dc:subject>fp frp links reddit </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:12:15+02:00&#034; href=&#034;http://www.reddit.com/r/programming/related/68xkq/frp_game_library_an_introduction_to_functional/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.reddit.com/r/programming/related/68xkq/frp_game_library_an_introduction_to_functional/&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/frp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/links"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/reddit"/></rdf:Bag></taxo:topics></item></rdf:RDF>