<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/css" href="/stylesheets/rss.css"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/">
  <channel>
    <title>ByteLabs: Category University of Linz</title>
    <link>http://blog.solaris.bytelabs.org/articles/category/university-of-linz</link>
    <language>en-us</language>
    <ttl>40</ttl>
    <description>additions to a vast pool of entropy by Igor and Ines</description>
    <item>
      <title>My First Book</title>
      <description>&lt;p&gt;My diploma thesis has &lt;a href="http://de.bookbutler.com/do/bookCompare?searchFor=3836461587&amp;#38;searchIn=de&amp;#38;amountIn=eur&amp;#38;shipTo=at"&gt;been published as book&lt;/a&gt;.&lt;/p&gt;


	&lt;p&gt;Amongst many other bookstores I found these quite cool:&lt;/p&gt;


	&lt;ul&gt;
	&lt;li&gt;&lt;a href="http://www.buecher.de/shop/Buecher/Automatic-Code-Generation-Using-Dynamic-Programming/Boehm-Igor/products_products/detail/prod_id/23467579/"&gt;Buecher.de&lt;/a&gt; has a nice page about it.&lt;/li&gt;
	&lt;/ul&gt;


	&lt;ul&gt;
	&lt;li&gt;&lt;a href="http://www.amazon.com/exec/obidos/ASIN/3836461587/ref=nosim/bookbutlercom-20"&gt;Amazon.com&lt;/a&gt; and &lt;a href="http://www.amazon.de/exec/obidos/tg/detail/offer-listing/-/3836461587/all"&gt;Amazon.de&lt;/a&gt; has it as well.&lt;/li&gt;
	&lt;/ul&gt;</description>
      <pubDate>Mon, 18 Feb 2008 23:35:00 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:65be1b85-558f-4cbf-9c97-08a465ae8599</guid>
      <author>igor</author>
      <link>http://blog.solaris.bytelabs.org/articles/2008/02/18/my-first-book</link>
      <category>University of Edinburgh</category>
      <category>University of Linz</category>
      <category>Hacking and Computers</category>
    </item>
    <item>
      <title>HBURG Version 1.1</title>
      <description>Last weekend I did a huge rewrite of &lt;span class="caps"&gt;HBURG&lt;/span&gt;&amp;#39;s backend. Besides many simplifications and optimizations I finally found some time to replace code that passed around state explicitly with &lt;a href="http://sigfpe.blogspot.com/2006/05/grok-haskell-monad-transformers.html"&gt;Haskell Monad Transformers&lt;/a&gt;. The following is an incomplete list of other fixes and improvements:
	&lt;ul&gt;
	&lt;li&gt;Rewrite rule costs can now include arbitrary expressions&lt;/li&gt;
		&lt;li&gt;Context sensitive analysis is fixed now since it was too restrictive and rejecting even correctly defined specifications&lt;/li&gt;
		&lt;li&gt;The &lt;strong&gt;Gen.Tiling&lt;/strong&gt; module has been complete removed and replaced by much simpler code&lt;/li&gt;
		&lt;li&gt;...&lt;/li&gt;
	&lt;/ul&gt;


	&lt;p&gt;You can either get the new version from &lt;a href="http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hburg-1.1"&gt;The Hackage&lt;/a&gt; or from &lt;a href="http://www.bytelabs.org/hburg.html"&gt;&lt;span class="caps"&gt;HBURG&lt;/span&gt;&amp;#39;s home&lt;/a&gt;.&lt;/p&gt;&lt;/p&gt;</description>
      <pubDate>Sun, 30 Sep 2007 19:20:00 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:2df88848-5520-4ccd-9d83-a3218943b3ff</guid>
      <author>igor</author>
      <link>http://blog.solaris.bytelabs.org/articles/2007/09/30/hburg-version-1-1</link>
      <category>University of Linz</category>
      <category>Diploma Thesis</category>
      <category>Hacking and Computers</category>
    </item>
    <item>
      <title>Exploiting Parallelism in Multi-way Recursive Methods</title>
      <description>&lt;p&gt;My &lt;a href="http://www.ssw.uni-linz.ac.at/Teaching/DiplomaTheses/AutomatischeCodeerzeugung/Aufgabenstellung.pdf"&gt;code generator&lt;/a&gt; which
is still in the prototyping and experimentation phase does &lt;strong&gt;a lot of recursive tree traversals&lt;/strong&gt; which is quite obvious since it
needs to match tree patterns and emit code for abstract syntax trees (AST).&lt;/p&gt;


	&lt;p&gt;Especially during the code emission phase which does a top down left to right tree traversal it would be nice to 
recursively evaluate child nodes of an &lt;span class="caps"&gt;AST&lt;/span&gt; in parallel if the evaluation of the child nodes does not yield any 
side effects. The following &lt;a href="http://citeseer.ist.psu.edu/31327.html"&gt;paper&lt;/a&gt; nicely describes how to transform
&lt;strong&gt;standard&lt;/strong&gt; multi-way recursive methods into &lt;strong&gt;parallel&lt;/strong&gt; mutli-way recursive methods in Java.&lt;/p&gt;


	&lt;p&gt;The transformation described is quite simple and works well for direct recursion. However, due to the attribute
type grammar I want to use for my tree pattern matching code generator and the way most tree patterns are
augmented with semantic actions, it seems that it would cause a bit of a mess, or at least require a lot of careful
thinking how to integrate such parallelism into the tree pattern matching grammar and the code generator 
which is produced by the grammar specification.&lt;/p&gt;


	&lt;p&gt;Unfortunately right now this idea can not be assigned a high priority and must be post-poned&amp;#8230;&lt;/p&gt;</description>
      <pubDate>Tue, 06 Mar 2007 20:58:00 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:3b2d29129dd4f3dd37f6cb5593054fbb</guid>
      <author>igor</author>
      <link>http://blog.solaris.bytelabs.org/articles/2007/03/06/exploiting-parallelism-in-multi-way-recursive-methods</link>
      <category>University of Linz</category>
      <category>Diploma Thesis</category>
      <category>Hacking and Computers</category>
    </item>
    <item>
      <title>Now it is Official</title>
      <description>&lt;p&gt;After signing the official papers my &lt;a href="http://www.ssw.uni-linz.ac.at/Teaching/DiplomaTheses/AutomatischeCodeerzeugung/Aufgabenstellung.pdf"&gt;diploma thesis&lt;/a&gt; is official
as of now. Even though it is going to be a lot of work to provide a clean, functional and
good implementation, I am really looking forward to it. Especially after having messed
around with and read about various compiler back end strategies.&lt;/p&gt;


	&lt;p&gt;Anyway, I am not dead but unfortunately I have almost no more time to blog. There
are also some people I really really really have to send an E-Mail to and this
right here is a promise that it will happen really soon!!!!&lt;/p&gt;</description>
      <pubDate>Thu, 08 Feb 2007 21:48:00 +0000</pubDate>
      <guid isPermaLink="false">urn:uuid:fdc7ff2c1485f4993b23a9b840520ebe</guid>
      <author>igor</author>
      <link>http://blog.solaris.bytelabs.org/articles/2007/02/08/now-it-is-official</link>
      <category>University of Linz</category>
      <category>Diploma Thesis</category>
      <category>Hacking and Computers</category>
    </item>
  </channel>
</rss>
