<?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/logic"><title>BibSonomy bookmarks for /user/draganigajic/logic</title><link>https://www.bibsonomy.org/user/draganigajic/logic</link><description>BibSonomy RSS Feed for /user/draganigajic/logic</description><items><rdf:Seq><rdf:li rdf:resource="http://settheory.com/intro.html"/><rdf:li rdf:resource="http://www.cs.auckland.ac.nz/CDMTCS/chaitin/unknowable/"/><rdf:li rdf:resource="http://www.informatik.uni-kiel.de/~pakcs/"/><rdf:li rdf:resource="http://danae.uni-muenster.de/~lux/curry/"/><rdf:li rdf:resource="http://en.wikipedia.org/wiki/Twelf"/><rdf:li rdf:resource="http://plato.stanford.edu/entries/intuitionistic-logic-development/"/><rdf:li rdf:resource="http://iml.univ-mrs.fr/~girard/coursang/coursang.html"/><rdf:li rdf:resource="http://yieldprolog.sourceforge.net/"/><rdf:li rdf:resource="http://logicaltypes.blogspot.com/2008/08/using-difference-lists.html"/><rdf:li rdf:resource="http://math.andrej.com/2008/08/13/intuitionistic-mathematics-for-physics/"/><rdf:li rdf:resource="http://mvanier.livejournal.com/2897.html"/><rdf:li rdf:resource="http://okmij.org/ftp/Computation/monads.html#LogicT"/><rdf:li rdf:resource="http://www.thenewsh.com/~newsham/formal/curryhoward/"/><rdf:li rdf:resource="http://twelf.plparty.org/wiki/Main_Page"/><rdf:li rdf:resource="http://www-ps.informatik.uni-kiel.de/~mh/pakcs/curryinput_c2p.cgi?ACTION=higher.curry"/><rdf:li rdf:resource="http://www.informatik.uni-kiel.de/~mh/curry/"/><rdf:li rdf:resource="http://www.disi.unige.it/person/MoggiE/"/><rdf:li rdf:resource="http://www.cis.upenn.edu/~bcpierce/"/><rdf:li rdf:resource="http://publish.uwo.ca/~jbell/catlogprime.pdf"/><rdf:li rdf:resource="http://www.cs.man.ac.uk/~pt/Practical_Foundations/"/></rdf:Seq></items></channel><item rdf:about="http://settheory.com/intro.html"><title>Introduction Comp Logic and Set Th - SETL</title><description></description><link>http://settheory.com/intro.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:39+02:00</dc:date><dc:subject>introduction logic pl setTheory setl </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:39+02:00&#034; href=&#034;http://settheory.com/intro.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://settheory.com/intro.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/introduction"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/setTheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/setl"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.auckland.ac.nz/CDMTCS/chaitin/unknowable/"><title>Chaitin, The Unknowable</title><description></description><link>http://www.cs.auckland.ac.nz/CDMTCS/chaitin/unknowable/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:30+02:00</dc:date><dc:subject>diophantine foundation lisp logic math metamath people research </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:30+02:00&#034; href=&#034;http://www.cs.auckland.ac.nz/CDMTCS/chaitin/unknowable/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.auckland.ac.nz/CDMTCS/chaitin/unknowable/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/diophantine"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/foundation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lisp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/metamath"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/people"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.informatik.uni-kiel.de/~pakcs/"><title>PAKCS</title><description></description><link>http://www.informatik.uni-kiel.de/~pakcs/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:12+02:00</dc:date><dc:subject>curry fp logic programming </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:12+02:00&#034; href=&#034;http://www.informatik.uni-kiel.de/~pakcs/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.informatik.uni-kiel.de/~pakcs/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/curry"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://danae.uni-muenster.de/~lux/curry/"><title>Münster Curry Compiler</title><description></description><link>http://danae.uni-muenster.de/~lux/curry/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:12+02:00</dc:date><dc:subject>compiler curry fp haskell logic pl </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:12+02:00&#034; href=&#034;http://danae.uni-muenster.de/~lux/curry/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://danae.uni-muenster.de/~lux/curry/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/compiler"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/curry"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pl"/></rdf:Bag></taxo:topics></item><item rdf:about="http://en.wikipedia.org/wiki/Twelf"><title>Twelf - Wikipedia, the free encyclopedia</title><description></description><link>http://en.wikipedia.org/wiki/Twelf</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:11+02:00</dc:date><dc:subject>cs logic ml proof twelf wikipedia </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:11+02:00&#034; href=&#034;http://en.wikipedia.org/wiki/Twelf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://en.wikipedia.org/wiki/Twelf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/proof"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/twelf"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wikipedia"/></rdf:Bag></taxo:topics></item><item rdf:about="http://plato.stanford.edu/entries/intuitionistic-logic-development/"><title>The Development of Intuitionistic Logic (Stanford Encyclopedia of Philosophy)</title><description></description><link>http://plato.stanford.edu/entries/intuitionistic-logic-development/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:10+02:00</dc:date><dc:subject>ebook encyclopedia intuitionism logic math philosophy stanford </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:10+02:00&#034; href=&#034;http://plato.stanford.edu/entries/intuitionistic-logic-development/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://plato.stanford.edu/entries/intuitionistic-logic-development/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ebook"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/encyclopedia"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/intuitionism"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/philosophy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/stanford"/></rdf:Bag></taxo:topics></item><item rdf:about="http://iml.univ-mrs.fr/~girard/coursang/coursang.html"><title>The Blind Spot</title><description></description><link>http://iml.univ-mrs.fr/~girard/coursang/coursang.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:10+02:00</dc:date><dc:subject>girard lectures logic math philosophy proof theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:10+02:00&#034; href=&#034;http://iml.univ-mrs.fr/~girard/coursang/coursang.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://iml.univ-mrs.fr/~girard/coursang/coursang.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/girard"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lectures"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/philosophy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/proof"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://yieldprolog.sourceforge.net/"><title>Yield Prolog</title><description>embeds prolog in js python c# using yield iterator</description><link>http://yieldprolog.sourceforge.net/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:10+02:00</dc:date><dc:subject>javascript logic prolog python </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;embeds prolog in js python c# using yield iterator&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/javascript"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/prolog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/python"/></rdf:Bag></taxo:topics></item><item rdf:about="http://logicaltypes.blogspot.com/2008/08/using-difference-lists.html"><title>Typed Logic: Using Difference Lists</title><description></description><link>http://logicaltypes.blogspot.com/2008/08/using-difference-lists.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:08+02:00</dc:date><dc:subject>*RIL *read blogpost haskell logic programming prolog </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:08+02:00&#034; href=&#034;http://logicaltypes.blogspot.com/2008/08/using-difference-lists.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://logicaltypes.blogspot.com/2008/08/using-difference-lists.html&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/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/prolog"/></rdf:Bag></taxo:topics></item><item rdf:about="http://math.andrej.com/2008/08/13/intuitionistic-mathematics-for-physics/"><title>Mathematics and Computation » Intuitionistic mathematics for physics</title><description></description><link>http://math.andrej.com/2008/08/13/intuitionistic-mathematics-for-physics/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:08+02:00</dc:date><dc:subject>intuitionism intuitionistic logic math philosophy physics tutorial </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:08+02:00&#034; href=&#034;http://math.andrej.com/2008/08/13/intuitionistic-mathematics-for-physics/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://math.andrej.com/2008/08/13/intuitionistic-mathematics-for-physics/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/intuitionism"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/intuitionistic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/philosophy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/physics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tutorial"/></rdf:Bag></taxo:topics></item><item rdf:about="http://mvanier.livejournal.com/2897.html"><title>mvanier: The Y Combinator (Slight Return)</title><description></description><link>http://mvanier.livejournal.com/2897.html</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:08+02:00</dc:date><dc:subject>*RIL *read combinator cs fp lambdacalculus lisp logic recursion scheme yCombinator </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:08+02:00&#034; href=&#034;http://mvanier.livejournal.com/2897.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://mvanier.livejournal.com/2897.html&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/combinator"/><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/lambdacalculus"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lisp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursion"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scheme"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/yCombinator"/></rdf:Bag></taxo:topics></item><item rdf:about="http://okmij.org/ftp/Computation/monads.html#LogicT"><title>Monads</title><description></description><link>http://okmij.org/ftp/Computation/monads.html#LogicT</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:07+02:00</dc:date><dc:subject>FP haskell logic monads olegKiselyov papers </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:07+02:00&#034; href=&#034;http://okmij.org/ftp/Computation/monads.html#LogicT&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://okmij.org/ftp/Computation/monads.html#LogicT&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/FP"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/monads"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/olegKiselyov"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/papers"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.thenewsh.com/~newsham/formal/curryhoward/"><title>The Curry-Howard Correspondence in Haskell</title><description>The Curry-Howard correspondence is a mapping between logic and type systems. On the one hand you have logic systems with propositions and proofs. On the other hand you have type systems with types and programs (or functions). As it turns out these two very different things have very similar rules. This article will explore the Curry-Howard correspondence by constructing a proof system using the Haskell type system (how appropriate since Haskell is named after Haskell Curry, the &#034;Curry&#034; in &#034;Curry-Howard&#034;). We&#039;ll set up the rules of logic using Haskell types and programs. Then we&#039;ll use these rules as an abstract interface to perform some logic profs.</description><link>http://www.thenewsh.com/~newsham/formal/curryhoward/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:07+02:00</dc:date><dc:subject>correspondence cs curry-howard fp haskell logic math proofs theory typeTheory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;The Curry-Howard correspondence is a mapping between logic and type systems. On the one hand you have logic systems with propositions and proofs. On the other hand you have type systems with types and programs (or functions). As it turns out these two very different things have very similar rules. This article will explore the Curry-Howard correspondence by constructing a proof system using the Haskell type system (how appropriate since Haskell is named after Haskell Curry, the &amp;#034;Curry&amp;#034; in &amp;#034;Curry-Howard&amp;#034;). We&amp;#039;ll set up the rules of logic using Haskell types and programs. Then we&amp;#039;ll use these rules as an abstract interface to perform some logic profs.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/correspondence"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/curry-howard"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/proofs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/typeTheory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://twelf.plparty.org/wiki/Main_Page"><title>Main Page - The Twelf Project</title><description></description><link>http://twelf.plparty.org/wiki/Main_Page</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:06+02:00</dc:date><dc:subject>cs deduction fp logic math ml pl proof twelf wiki </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:06+02:00&#034; href=&#034;http://twelf.plparty.org/wiki/Main_Page&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://twelf.plparty.org/wiki/Main_Page&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/deduction"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/proof"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/twelf"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wiki"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www-ps.informatik.uni-kiel.de/~mh/pakcs/curryinput_c2p.cgi?ACTION=higher.curry"><title>curry interpreter PAKCS</title><description>online curry interpreter</description><link>http://www-ps.informatik.uni-kiel.de/~mh/pakcs/curryinput_c2p.cgi?ACTION=higher.curry</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:06+02:00</dc:date><dc:subject>! *RIL *read curry demo fp logic pl webapp </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;online curry interpreter&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/!"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*RIL"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/*read"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/curry"/><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/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/webapp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.informatik.uni-kiel.de/~mh/curry/"><title>The Functional Logic Language Curry</title><description></description><link>http://www.informatik.uni-kiel.de/~mh/curry/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:06+02:00</dc:date><dc:subject>*RIL *read FP cs curry declarative haskell logic logicProgramming </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:06+02:00&#034; href=&#034;http://www.informatik.uni-kiel.de/~mh/curry/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.informatik.uni-kiel.de/~mh/curry/&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/FP"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/curry"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/declarative"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logicProgramming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.disi.unige.it/person/MoggiE/"><title>Eugenio Moggi Information Page - DISI</title><description></description><link>http://www.disi.unige.it/person/MoggiE/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:05+02:00</dc:date><dc:subject>*RIL *read bibliography categoryTheory cs logic math monads people pl research </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:05+02:00&#034; href=&#034;http://www.disi.unige.it/person/MoggiE/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.disi.unige.it/person/MoggiE/&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/bibliography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/categoryTheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/monads"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/people"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cis.upenn.edu/~bcpierce/"><title>Benjamin C. Pierce</title><description></description><link>http://www.cis.upenn.edu/~bcpierce/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:05+02:00</dc:date><dc:subject>*RIL *read bibliography bidirectional categoryTheory coq cs fp haskell lectures logic ml people pl research sync teaching typeTheory unison upenn xml </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:05+02:00&#034; href=&#034;http://www.cis.upenn.edu/~bcpierce/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cis.upenn.edu/~bcpierce/&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/bibliography"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bidirectional"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/categoryTheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/coq"/><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/haskell"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lectures"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/people"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sync"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/teaching"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/typeTheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/unison"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/upenn"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/xml"/></rdf:Bag></taxo:topics></item><item rdf:about="http://publish.uwo.ca/~jbell/catlogprime.pdf"><title>The Development of Categorical Logic</title><description></description><link>http://publish.uwo.ca/~jbell/catlogprime.pdf</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:04+02:00</dc:date><dc:subject>book categoryTheory from:realsplog logic math </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-07-13T18:13:04+02:00&#034; href=&#034;http://publish.uwo.ca/~jbell/catlogprime.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://publish.uwo.ca/~jbell/catlogprime.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/book"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/categoryTheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/from:realsplog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.man.ac.uk/~pt/Practical_Foundations/"><title>Practical Foundations of Mathematics</title><description>clevnet has the book</description><link>http://www.cs.man.ac.uk/~pt/Practical_Foundations/</link><dc:creator>draganigajic</dc:creator><dc:date>2011-07-13T18:13:04+02:00</dc:date><dc:subject>100+ categoryTheory dependent-types foundation from:realsplog logic math setTheory theory typetheory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;clevnet has the book&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/100+"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/categoryTheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dependent-types"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/foundation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/from:realsplog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/setTheory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/typetheory"/></rdf:Bag></taxo:topics></item></rdf:RDF>