Data structure

Previous Topic Next Topic
 
classic Classic list List threaded Threaded
3 messages Options
Reply | Threaded
Open this post in threaded view
|

Data structure

yrazes

Hi guys,

I want to compare data structure between Haskell, Java, Lisp and C. I am wondering if I could compare list comprehention in haskell with the vector class in Java, macros in common lisp and dynamic arrays in C.

Thanks,
Julita


_______________________________________________
Haskell-Cafe mailing list
[hidden email]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Reply | Threaded
Open this post in threaded view
|

Re: Data structure

Ketil Malde-5
yrazes <[hidden email]> writes:

> I want to compare data structure between Haskell, Java, Lisp and C. I am
> wondering if I could compare list comprehention in haskell with the vector
> class in Java, macros in common lisp and dynamic arrays in C.

You /can/ compare them, of course, but they are very different
concepts.  I'd classify list comprehensions and macros as control
structures, rather than data structures, for instance.

Wouldn't it be more appropriate to compare Haskell's algebraic data
types with C structs, Java classes, and Lisp S-expressions?

-k
--
If I haven't seen further, it is by standing in the footprints of giants

_______________________________________________
Haskell-Cafe mailing list
[hidden email]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Reply | Threaded
Open this post in threaded view
|

Re: Data structure

yrazes
sure!

types are something you can compare and the differences are so clear

but I will probe the code in some programs like bubble sort (least efficient)

including DataBase (HDBC) and MySql...

This time, my mail is concerning about "queuing theory", hmmmm... I tough 
list are nice concept for this purpose... I wan't so sure about the other languages.

Julita


On Thu, Sep 1, 2011 at 2:16 AM, Ketil Malde <[hidden email]> wrote:
yrazes <[hidden email]> writes:

> I want to compare data structure between Haskell, Java, Lisp and C. I am
> wondering if I could compare list comprehention in haskell with the vector
> class in Java, macros in common lisp and dynamic arrays in C.

You /can/ compare them, of course, but they are very different
concepts.  I'd classify list comprehensions and macros as control
structures, rather than data structures, for instance.

Wouldn't it be more appropriate to compare Haskell's algebraic data
types with C structs, Java classes, and Lisp S-expressions?

-k
--
If I haven't seen further, it is by standing in the footprints of giants


_______________________________________________
Haskell-Cafe mailing list
[hidden email]
http://www.haskell.org/mailman/listinfo/haskell-cafe