uot;/emotional
Andreas
---
Andreas C. Doering
Medizinische Universitaet zu Luebeck
Institut fuer Technische Informatik
Tel.: +4
in C.
I did not yet try to use parHaskell so we have nice parallel systems here
(e.g. cluster with 96 Pentiums).
Andreas
---
Andreas C. Doering
Medizinische Universitaet z
Hi,
having worked with some CA systems I want to add that
not only the collection of algorithms is important but also the
data base of algebraic objects.
For instance the group theoretic package Magma (formerly Caley) comes
with as much information on finite groups as the the libraries of algo
mount
of predefined functions to work with types, but I guess most of them are
already defined in the compiler/interpreter sources.
Andreas
---
Andreas C. Doering
Medizinische Universitaet z
[EMAIL PROTECTED]
I will ask him.
I made a BDD-lib already, but it uses an array to store the nodes, and
garbage collection is explicitely programmed on this array
requiring reallocation, contents copying and so forth, very ugly.
Andreas
-
It ould be so much nicer with this operation.
Andreas
---------------
Andreas C. Doering
Medizinische Universitaet zu Luebeck
Institut fuer Technische Informatik
Ratzeburger Allee 160
"Metacode" (like the === rewrite rules) for optimizations
if we tell it to do so.
Whether it is better to write down the orders or the prohibitions is due to
experimentation.
Andreas
---
Andreas C
Hi,
I am currently playing around whereby the following questions arose:
I use currently Hugs (1.4.)
1) My application has a huge amount of memory (from parsing a
text representation of an PCB, i.e. CAD data)
Since the data is used in a totally different sequence
than it is read, I gue
