<?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/mobileink/recursion"><title>BibSonomy bookmarks for /user/mobileink/recursion</title><link>https://www.bibsonomy.org/user/mobileink/recursion</link><description>BibSonomy RSS Feed for /user/mobileink/recursion</description><items><rdf:Seq><rdf:li rdf:resource="http://csgsoft.doc.ic.ac.uk/datadec/"/><rdf:li rdf:resource="http://72.14.203.104/search?q=cache:BMyfIE3nSO0J:www.cs.dartmouth.edu/~ac/Teach/CS21-Winter04/ch4.pdf+induction+recursion&amp;hl=en&amp;gl=us&amp;ct=clnk&amp;cd=10&amp;client=firefox-a"/><rdf:li rdf:resource="http://www.cs.cmu.edu/People/rwh/introsml/techniques/structur.htm"/><rdf:li rdf:resource="http://www.findarticles.com/p/articles/mi_qa3742/is_199711/ai_n8763902"/><rdf:li rdf:resource="http://www.nist.gov/dads/HTML/recursion.html"/><rdf:li rdf:resource="http://www.olympus.net/personal/7seas/recurse.html"/><rdf:li rdf:resource="http://www.media.mit.edu/physics/pedagogy/babbage/texts/rt.html"/><rdf:li rdf:resource="http://personal.vsnl.com/erwin/recursion.htm"/><rdf:li rdf:resource="http://et.nmsu.edu/~etti/winter98/computers/jenkins/jenkins.html"/><rdf:li rdf:resource="http://mathworld.wolfram.com/Self-Recursion.html"/><rdf:li rdf:resource="http://www.jetcafe.org/~jim/highlowc.html"/></rdf:Seq></items></channel><item rdf:about="http://csgsoft.doc.ic.ac.uk/datadec/"><title>datadec - ANSI C Recursive Data Type Generator</title><description>Datadec takes recursive data types modelled on those found in functional languages (Hope, Miranda, Haskell etc) and generates ANSI C code to implement them.</description><link>http://csgsoft.doc.ic.ac.uk/datadec/</link><dc:creator>mobileink</dc:creator><dc:date>2006-07-02T03:49:24+02:00</dc:date><dc:subject>c clib recursion dev </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Datadec takes recursive data types modelled on those found in functional languages (Hope, Miranda, Haskell etc) and generates ANSI C code to implement them.&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/clib"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursion"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dev"/></rdf:Bag></taxo:topics></item><item rdf:about="http://72.14.203.104/search?q=cache:BMyfIE3nSO0J:www.cs.dartmouth.edu/~ac/Teach/CS21-Winter04/ch4.pdf+induction+recursion&amp;hl=en&amp;gl=us&amp;ct=clnk&amp;cd=10&amp;client=firefox-a"><title>Induction, Recursion, and Recurrences</title><description></description><link>http://72.14.203.104/search?q=cache:BMyfIE3nSO0J:www.cs.dartmouth.edu/~ac/Teach/CS21-Winter04/ch4.pdf+induction+recursion&amp;hl=en&amp;gl=us&amp;ct=clnk&amp;cd=10&amp;client=firefox-a</link><dc:creator>mobileink</dc:creator><dc:date>2006-01-27T02:51:03+01:00</dc:date><dc:subject>induction recursion </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-01-27T02:51:03+01:00&#034; href=&#034;http://72.14.203.104/search?q=cache:BMyfIE3nSO0J:www.cs.dartmouth.edu/~ac/Teach/CS21-Winter04/ch4.pdf+induction+recursion&amp;amp;hl=en&amp;amp;gl=us&amp;amp;ct=clnk&amp;amp;cd=10&amp;amp;client=firefox-a&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://72.14.203.104/search?q=cache:BMyfIE3nSO0J:www.cs.dartmouth.edu/~ac/Teach/CS21-Winter04/ch4.pdf+induction+recursion&amp;amp;hl=en&amp;amp;gl=us&amp;amp;ct=clnk&amp;amp;cd=10&amp;amp;client=firefox-a&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursion"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.cmu.edu/People/rwh/introsml/techniques/structur.htm"><title>Structural Induction</title><description></description><link>http://www.cs.cmu.edu/People/rwh/introsml/techniques/structur.htm</link><dc:creator>mobileink</dc:creator><dc:date>2006-01-26T12:42:46+01:00</dc:date><dc:subject>induction recursion </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-01-26T12:42:46+01:00&#034; href=&#034;http://www.cs.cmu.edu/People/rwh/introsml/techniques/structur.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.cmu.edu/People/rwh/introsml/techniques/structur.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursion"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.findarticles.com/p/articles/mi_qa3742/is_199711/ai_n8763902"><title>Quine&#039;s NF--60 years on</title><description>set theory</description><link>http://www.findarticles.com/p/articles/mi_qa3742/is_199711/ai_n8763902</link><dc:creator>mobileink</dc:creator><dc:date>2006-01-26T12:16:17+01:00</dc:date><dc:subject>logic zf recursion math </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;set theory&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/zf"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursion"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.nist.gov/dads/HTML/recursion.html"><title>recursion</title><description>definition</description><link>http://www.nist.gov/dads/HTML/recursion.html</link><dc:creator>mobileink</dc:creator><dc:date>2006-01-26T11:56:23+01:00</dc:date><dc:subject>recursion glossary </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;definition&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursion"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/glossary"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.olympus.net/personal/7seas/recurse.html"><title>Stack Free Recursion</title><description>A method of building recursive functions in systems that don&#039;t have a data stack is presented...We reduce beautiful recursive code to unintelligible spaghetti code that uses less memory and sometimes is faster.</description><link>http://www.olympus.net/personal/7seas/recurse.html</link><dc:creator>mobileink</dc:creator><dc:date>2006-01-26T09:27:58+01:00</dc:date><dc:subject>recursion implementation </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;A method of building recursive functions in systems that don&amp;#039;t have a data stack is presented...We reduce beautiful recursive code to unintelligible spaghetti code that uses less memory and sometimes is faster.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursion"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/implementation"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.media.mit.edu/physics/pedagogy/babbage/texts/rt.html"><title>Introduction to Logic and Recursion Theory</title><description>class notes</description><link>http://www.media.mit.edu/physics/pedagogy/babbage/texts/rt.html</link><dc:creator>mobileink</dc:creator><dc:date>2006-01-26T09:16:51+01:00</dc:date><dc:subject>logic recursion </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;class notes&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursion"/></rdf:Bag></taxo:topics></item><item rdf:about="http://personal.vsnl.com/erwin/recursion.htm"><title>Programming with Recursion</title><description>tutorial</description><link>http://personal.vsnl.com/erwin/recursion.htm</link><dc:creator>mobileink</dc:creator><dc:date>2006-01-26T09:11:44+01:00</dc:date><dc:subject>recursion </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;tutorial&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursion"/></rdf:Bag></taxo:topics></item><item rdf:about="http://et.nmsu.edu/~etti/winter98/computers/jenkins/jenkins.html"><title>recursion</title><description>sample pgms in C</description><link>http://et.nmsu.edu/~etti/winter98/computers/jenkins/jenkins.html</link><dc:creator>mobileink</dc:creator><dc:date>2006-01-26T08:57:16+01:00</dc:date><dc:subject>litprog recursion </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;sample pgms in C&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/litprog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursion"/></rdf:Bag></taxo:topics></item><item rdf:about="http://mathworld.wolfram.com/Self-Recursion.html"><title>Self-Recursion -- From MathWorld</title><description>&#034;Self-recursion is a recursion that is defined in terms of itself, resulting in an ill-defined infinite regress.&#034;  Huh?</description><link>http://mathworld.wolfram.com/Self-Recursion.html</link><dc:creator>mobileink</dc:creator><dc:date>2006-01-26T08:37:11+01:00</dc:date><dc:subject>recursion </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;&amp;#034;Self-recursion is a recursion that is defined in terms of itself, resulting in an ill-defined infinite regress.&amp;#034;  Huh?&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursion"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.jetcafe.org/~jim/highlowc.html"><title>High and Low-Level C</title><description>C coding</description><link>http://www.jetcafe.org/~jim/highlowc.html</link><dc:creator>mobileink</dc:creator><dc:date>2006-01-26T08:33:41+01:00</dc:date><dc:subject>c programming recursion </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;C coding&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/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recursion"/></rdf:Bag></taxo:topics></item></rdf:RDF>