the better
algorithms made it.
Just my opinion.
Andreas
---
Andreas Doering
Medizinische Universitaet zu Luebeck
Institut fuer Technische Informatik
Dear John,
sorry there was a mistake in my last mail, and that's the reason, that
it ends so apruptly.
The class StateTran is
class States a = StateTran t a where
trans :: t - a - (StatesMap a) -- give the transformation
arity :: t - a - Int -- where 0 means: arbitrary
This is the
Hi,
I have some small algorithms implemented in gofer, using also
a little class structure.
One class uses two parameters, as it is legal in gofer.
But not in haskell. The question, how I come out of this.
First idea is: choose one parameter, and put the second one into
member function
Dear John,
never mind, I have found meanwhile a good (?) hierarchy that does the job.
Perhaps I was too impatient about the learning curve.
All the examples and also the difficulties with step and apply are overcome.
Since all looks very clear, I hope that I am on the right track.
On weekend, I
Hello,
I am new to this group (and haskell) and I have read in the
introduction of the report (1.2) about research in
supplying classes with (as I understand constant ) parameters.
As I need a class for finite sets, I think this concept would suit well
here:
Of course, there is a simple
