sure!<div><br></div><div>types are something you can compare and the differences are so clear</div><div><br></div><div>but I will probe the code in some programs like bubble sort (least efficient)</div><div><br></div><div>
including DataBase (HDBC) and MySql...</div><div><br></div><div>This time, my mail is concerning about &quot;queuing theory&quot;, hmmmm... I tough </div><div>list are nice concept for this purpose... I wan&#39;t so sure about the other languages.</div>
<div><br></div><div>Julita</div><div><br><br><div class="gmail_quote">On Thu, Sep 1, 2011 at 2:16 AM, Ketil Malde <span dir="ltr">&lt;<a href="mailto:ketil@malde.org">ketil@malde.org</a>&gt;</span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div><div></div><div class="h5">yrazes &lt;<a href="mailto:yrazes@gmail.com">yrazes@gmail.com</a>&gt; writes:<br>
<br>
&gt; I want to compare data structure between Haskell, Java, Lisp and C. I am<br>
&gt; wondering if I could compare list comprehention in haskell with the vector<br>
&gt; class in Java, macros in common lisp and dynamic arrays in C.<br>
<br>
</div></div>You /can/ compare them, of course, but they are very different<br>
concepts.  I&#39;d classify list comprehensions and macros as control<br>
structures, rather than data structures, for instance.<br>
<br>
Wouldn&#39;t it be more appropriate to compare Haskell&#39;s algebraic data<br>
types with C structs, Java classes, and Lisp S-expressions?<br>
<br>
-k<br>
<font color="#888888">--<br>
If I haven&#39;t seen further, it is by standing in the footprints of giants<br>
</font></blockquote></div><br></div>