Re: [Haskell] Guidelines for respectful communication

cafe (and perhaps to some forum outside Haskell as well), I knew many people (my former students for example), who read only the  -café list... Live long and prosper.  🖖 Jerzy Karczmarczuk [France.] ___ Haskell mailing list Haskell@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell

Re: [Haskell] please improve this code - thanks

might help? Jerzy Karczmarczuk Caen, France ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] Image manipulation

another story... Generating music (low level, i.e. sound patterns) through lazy algorithms is quite interesting. Jerzy Karczmarczuk ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] Image manipulation

emory with thunks may degrade the performance of an image processing tool... Jerzy Karczmarczuk ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] Power series in a nutshell

bit more involved, there is a paper (sorry for shameless auto-ad) published more that 10 years ago, copy here: http://users.info.unicaen.fr/~karczma/arpap/lazysem.pdf Jerzy Karczmarczuk ___ Haskell mailing list Haskell@haskell.org http

Re: [Haskell] Silly question on interactive import

nless somebody knows how, but then, I would have already an answer, you are all very helpful. Thanks. Jerzy Karczmarczuk ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] Silly question on interactive import

criminated module... Jerzy Karczmarczuk ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] Silly question on interactive import

destroys the access to the module Char. (:add as well). Well, I won't die if there is no way to do it. But am I obliged to import Char within parse? Of course, interactive import is illegal... Thanks. Jerzy Karczmarczuk ___ Haskell mailing list Ha

Re: [Haskell] Can anyone help...

. Jerzy Karczmarczuk ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] Can anyone help me with partition numbers?

Doaitse Swierstra wrote: Or (since we started to do someone's homework anyway) generate 0 = [[]] generate n = [x:rest | x <- [1..n], rest <- generate (n-x)] Unless I am misled, this will generate the *unordered* partitions, e.g., for n=7, 64 of them, not 15. Jerzy K

Re: [Haskell] Re: About Random Integer without IO

t the improbable, but possible repetition of the sequence, which would invalidate the soundness of the gathering of statistical data. Thank you for your interest (if you got down to here...) Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] Re: 2-D Plots, graphical representation of massive data

the system was rather chaotic... It is still not *very* high level, and for the moment it seems less appropriate for serious plots than piping raw data to Matlab or similar. But to draw diagrams or simplistic curves, why not? Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] 2-D Plots, graphical representation of massive data

ll an unexploited niche for Haskell, and I hope that it will change one day. I would like to ask the original poster, who asked first about the Matlab<->Haskell links what are her/his *concrete* problems... Jerzy Karczmarczuk ___ H

Re: [Haskell] System.Random

odule Random might of course use Time or similar entities for the randomization/initialization, but this is a contingency. Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Why are strings linked lists?

Robert Will wrote: Why is 'last' so much slower than 'head'? Why is 'head' not called 'first'? Why does 'but_last' (aka init) copy the list, but 'but_first' (aka tail) does not? Are those rhetoric questions, asked just to insp

Re: show function

ht see languages where functional entities KEEP A LOT of secondary information, which permit to auto-document them in a more specific, communicative way. Look at Python functions... Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Why are strings linked lists?

ly the file buffer. Haskell introduces some overhead. I believe that the only advantage of keeping string as lists is to facilitate their lazy processing. Writing parsers and other lng string consumers. But, as ajb said above, it can pass through a lazy conversion stage, comprehensions, etc. Jerzy

Re: "interact" behaves oddly if used interactively

lin demonstrated one such category. I need laziness to implement co-recursive data structures for scientific applications. (If you wish, have another Great Truth: "Ideally any programs should be independent of the language used for coding them..." Now, try to convince

Re: Haskell for non-Haskell's sake

be interesting to organize some workshops on "practical" applications of functional programming...) Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: User-Defined Operators

tomatic choice of \mathitalic. Read something about families, about \mathchardef, and about such options as \displaystyle \scriptstyle, etc., in order to choose automatically the correct size of the math. fonts. Also read something about big operators useful to define objects like sum, produ

Re: How overload operator in Haskell?

quot;, and I am sure all of you see why. I think that a more sane solution would be the definition of a particular class with operations porting names like <+>, or ^+^, or whatever similar to standard ones, but different. Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: let (d,k) = (g x y, h x d) ..

on. > So that I did not notice the `error' for a long time. > > Is really the Haskell pattern matching semantic so that f and f' > are equivalent ? But, in a lazy language it is the same, the let defs. are processed colaterally, the only difference is the (possibly optimiz

Re: palm?

s inside a FORTH processor implemented on 8bit machines, you would agree with me. But I do not exclude the possibility that all this has been already discussed and rejected for some serious reasons... Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL

Re: Random Permutations

. With mergesort I believe that you get your permutations faster. Anyway, I will not defend the sorting approach as something ideal. Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Random Permutations

and 1. 2. Form N pairs (1,r_1), (2,r_2), (3, r_3) ... (N,r_n). 3. Sort this list/vector wrt the *secon* (random) number. 4. In the sorted list the firs values (indices) give you the result. This is of course quite general, not restricted to any Haskell peculiarities. Jerzy Karczma

Re: Interesting Read (fwd)

. Jerzy Karczmarczuk (of course this posting belongs rather to the list haskell-beer ...) ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: ANNOUNCE: Learning Haskell portal, version 0.1

: Scheme, absolutely: ML variants, and Erlang. Such questions are, and will continue to be recurring. Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Dispatch on what? (Was: seeking ideas for short lecture on type classes)

the *message identifiers* independently of subsidiary arguments. Only after that - perhaps - some "reversions", message propagation depending on the arg(s) value(s), etc. may take place, but all this is irrelevant... Forgive me if I write stupidities. Jerzy Karczmarczuk

Re: Lazy evaluation alternative

Chris Clearwater wrote: On Fri, Jan 24, 2003 at 01:51:57PM +0100, Jerzy Karczmarczuk wrote: > Hey, Maestro, why don't you check before posting, hm? What is the type > of ones? I am afraid you will get a nasty surprise... Check what, the type? Or are you refering to the double post

Re: Lazy evaluation alternative

, Maestro, why don't you check before posting, hm? What is the type of ones? I am afraid you will get a nasty surprise... ... BTW, are you sure there aren't any missing parentheses in the def. of natural? (But they won't help anyway...) Jer

Re: Implementing forward refs in monadic assembler and interpreter

zily. Then no forward reference can hurt you. If I may, a shameless personal plug. Look at my paper presented at the last FDPE, a construction of a CPS "assembly-style" interpreter, with lazy code deployment tricks. Jerzy Karczmarczuk __

A question concerning functional dependencies

r my own instruction. Good people, help, please. Why v [->s] cannot "coexist" in this context with ((v->s)->v) [->s] Of course all extensions, including overlapping instances are on. Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Lists representations (was: What does FP do well? (was ...))

flow control structures, etc. etc. === OK, for me the moral is now - I wouldn't say clean [pun intended], but quite clear: Strict data structures in Haskell should belong to different types than the co-recursive ones. With different implementation, in particular, for arrays. Jerzy Karc

Re: What does FP do well? (was How to get ...)

concatenation of (parts of) such lists might also have very bad behaviour. Can you calm my anxiety? Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: ideas for compiler project

is marching very fast, not only in the direction of very-fast-even-more-dirty routines, but also in the direction of new conceptualization/representation models (like, e.g., "actors" in VTK). Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: differentiation. Reply

shed in HOSC last year. But somebody might get interested in some geometric extensions thereof (differential forms) http://users.info.unicaen.fr/~karczma/arpap/ltforms.pdf Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Haskell in the teaching of Maths

e system adapted to math hierarchies, and this is far from trivial, people from Axiom, Magma and MuPAD zones worked for years on that. Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

GHC installation

have plenty of space on another partition, but the installer complains that it lacks space. Any suggestions, please? Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

strong typing is not a panaceum, and, anyway...

then the program probably wasn't important > enough to be worth writing in the first place. If an entity is sufficiently complex, there will be always a margin of error. Good if avoidable, but... Would you apply the same philosophy of "non-importance" of a possibly bugged result, t

Re: Standard Prelude - Floating Class

h, etc. And what is this: "typical Haskell implementor"? Do you know many of them? Do you think really that some fellow totally inconscious in the domain of STANDARD numeric maths, somebody who never heard about IEEE etc. will NOW engage in implementing Haskell? What is the rationale behind

Re: Haskell 98 - Standard Prelude - Floating Class

y hold for the Complex numbers as well. The gymnastics with complex sinh and cosh seems to be redundant. 3. The above code is less than useful for a person who really needs it. I would propose rather the most obvious sinh x = (u-recip u)/2 where u=exp x etc. Jerzy Karczmarczuk _

macros. Was: Arrow notation, etc.

e *are* people who see a need for them in a lazy language. Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Harmful spammers

Sorry for the pollution. Is there a way to kill the guys from: @bid4placement.com ? They managed already 3 times to block my mailer with their HTML, via Haskell list. Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http

Unary minus (was: micro-rant)

ic one, so f -5 and f (-5) are a bit different. I didn't follow this discussion, but please avoid this mess in Haskell. Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Homeworks and art of flying.

ation homework "x 2 3 4" = ("x", [2, 3, 4]) homework _ = error "You can't" Note the cleverness and universalness of the solution. Jerzy Karczmarczuk Caen, France PS. A deep philosophical quotation seems appropriate here. Here is one from Douglas

Re: Templates in FPL?

the relation of these "macros" to class system is another story. Thanks. Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Templates in FPL?

people use it every day...) Is it absolutely senseless to make a functional language with templates? Or it is just out of fashion, and difficult to implement? == This is a sequel to a former discussion about macros, of course... Jerzy Karczmarczuk Caen, France _

Re: Monads

ce by Wadler, and used by myself to implement the reverse automatic differentiation algorithm. Understanding what's going on is difficult. The <> syntax makes it *worse*.) Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Monads

Ashley Yakeley comments: > > Jerzy Karczmarczuk wrote: > > >Monads are *much* more universal than that. They are "convenient patterns" > >to code the non-determinism (lazy list monads), to generalize the concept > >of continuations, to add trac

Re: Monads

;t really NEED monads (unless you are forced to do IO...), but when you learn them you will feel better and older. Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: BAL paper available >> graphic libraries

uot; into run-time checks is not enough in this context, we know that we need a genuine object-oriented genericity for graphical entities. Perhaps even with multiple inheritance or the java-style "interfaces". So, again, a bit more than just "graphic library". Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: BAL paper available

y, Sergey did a formidable work, and this should be acknowledged even by those who on this list criticized his presentation. Thanks. Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Class RealFrac: round

cally, and from time to time I do some mistakes, although I know the stuff. Look here: (among 100 other references I could give you) http://www.validgh.com/goldberg/addendum.html http://developer.intel.com/technology/itj/q41999/articles/art_6.h

Re: List of words

? Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: toRational (0.9). Reply

stores a decimal constant as an EXACT number, and the "full language" as a floating INEXACT. For two days I thought that the function 'floor' is buggy. Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: constants and functions without arguments

h in a pure functional language there are no differences. This is another problem, most probably beyond what interests A. L., but as you see, people think about such things. Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: A GUI toolkit looking for a friend

an I/O, refraining from using this pseudo-imperative style: # object = doSomethingWith object # object = andMoreProcessingOf object ... and constructing monadic chains, I finally gave up, because my fingers generated too many bugs. But this is a personal observation, I am sure that more discip

Re: 'any' and 'all' compared with the rest of the Report

lication of an object by an integer, where the object was so non-standard, that the only way of implementing N*X was: X+X+...+X. So, Eric, don't call this algorithm "messy". (I suspect that you are joking, but ALL comp. sci students should

Re: Specifications of 'any', 'all', 'findIndices'

ot so obviously... I am not sure about this higher level of abstraction. Unless, of course, we want to use generalized, monadic maps, but then, also folds. And we will produce, say, trees of boolean garbage instead of lists. Jerzy Karczmarczuk ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Specifications of 'any', 'all', 'findIndices'

ho said that what Eric Shade proposes is an evil optimization, while a curried "pearl": "any p = or . map p" is a nice shorthand, plenty of vitamines, especially for beginners. BTW., why not promote something like any = (or .) . map to make everybody happy? Jerzy Karczmarczu

Re: group theory. Reply

te with pleasure in it, although the time factor is still there... Dima Pasechnik (<[EMAIL PROTECTED]>; does he read it?) - apparently - as well. Jerzy Karczmarczuk Caen, France ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: numericEnumFromThenTo strangeness

ee this definition: fromEnum = truncate for Rationals, then this is hardly a surprise. [Unless I have an obsolete version of everything, which is possible. I apologize then, but the following paragraph remains.] My permanent, constant suggestion: revise all the numeric classes very thoroughly. Begi

Re: More on Quantum vectors...

s of FP. The beginning of this paper is an elementary introduction to FP you won't probably need... Anyway, thank you *very* much for your interest. == Jerzy Karczmarczuk Caen, France

More on Quantum vectors...

tion formulae are usually very tedious to implement, unless one dares to use some lazy coding. Then you can economize a few days of pencil work, and you can spend this time rolling on the ground and laughing at the people who claim that Haskell is useless for practical computations, because they don't know how to implement some middle-Chinese chess in it. Jerzy Karczmarczuk Caen, France

Re: Module QuantumVector

to R3... Moreover, I assure you that some non-orthogonal bases are of extreme importance in physics, a canonical example being the coherent states in optics. Jerzy Karczmarczuk

Re: Haskell -> Java bytecode?

language, why it would be more pleasant than Java (or Tcl/Tk, or ...) *IN THIS CONCRETE CONTEXT*? (There are two problems here: the coding of some nice algorithm which does something very inspiring, and ... ... the interfacing. And here Haskell and Java are worlds apart.) Jerzy Karczmarczuk Caen, France

Re: import List(..) // fromInteger etc.

ing). Yet, the current Haskell hierarchy forces you to declare the concerned data structures as belonging to "Floating", which at the beginning I found annoying, and now I consider very harmful. Down with the slavery imposed by the Standard Prelude! Jerzy Karczmarczuk Caen, France. ===

Re: Block simulation / audio processing

solutions as trajectories and *not* as sequences of events, you forget about clocks. (This is my very naive and minima- listic viewpoint...) The *strictly technical* problem on how to control the step size depends on the algorithm. I wonder whether there are some generic strategies here. Jerzy Kar

Re: Block simulation / audio processing

Lava approach to those loops then. OK, I will read the cited paper. For the moment Koen mentioned that the system "detect" loops. And the real fun *begins* here... Jerzy Karczmarczuk Caen, France

Re: Block simulation / audio processing

rmed audio samples. Thank you for the inspiration. If I had time enough... Jerzy Karczmarczuk Caen, France

classes and algebra

and most people trying to use Haskell for mathematically oriented manipulations will leave this ship and move elsewhere.] Jerzy Karczmarczuk Caen, France

Re: Impasse for math ...

, blahBlah, and somebody will say that it doesn't solve any real problem. But now you start to implement something, and you realize that you essentially get some "theorems for free". Something is easy to be formally specified along one path, and the actual code goes along the other. And you deforestate the chain of "maps" without even moving your finger. Jerzy Karczmarczuk Caen, France

Re: FFT in Haskell, plagiarism?

If the student claims that he invented it himself, propose him to write an article about, and to send it directly to the Nobel prize committee. Jerzy Karczmarczuk Caen, France.

Re: Impasse for math in Haskell 2

to a purely speculative layer of science/philosophy, and will *never* find any applications, for example the theory of categories, or non-classical logic. http://www.math.sunysb.edu/~kirillov/tensor/tensor.html http://math.nwu.edu/~getzler/conf97.html === Jerzy Karczmarczuk Caen, France

Re: doubly linked list

ly used for the maintenance of the co-routine bedlam exploited in simulation programs. The idea of double lists was to permit a fast two-directional navigation, and the ease of insertion/deletion. But in Haskell, where the beasts are not mutable: ... Actually, has anybody really used them for pr

Re: doubly linked list

, when you find it please send me the references. But there are previous works, see the article published in Software 19(2), (1989) by Lloyd Allison, "Circular programs and self-referential structures". Jerzy Karczmarczuk Caen, France PS. Oh, I see now that the KW article has been found... Well, I send you my solution anyway.

Just for fun

If you try to exercize some popular Web search engines on: "Haskell Library" you will get this: http://www.vtonly.com/hstydec9.htm Perhaps we should send them the Report? Jerzy Karczmarczuk Caen, France.

Re: Ratio: (-1:%1) < (-1:%1)?

d would cry that (r,theta) is equal but not really, to (r,theta+2PI). The only safe way of dealing with it is to use a brutal screening of the constructor and the selectors, to make them private, to use OO methods to access everything. The automatic derivation of Eq is obviously silly, but I do

Re: speed of everything

"Andreas C. Doering" wrote: ... > I would love to get higher performance without much effort. > For one result I had to wait for over a week, ... So do I, so do I! Twice I had to wait 9 months. But the results are nice. Jerzy Karczmarczuk Caen, France

Nothing important

... but could someone fix the word Feburary on the Hugs98 page? BTW, it is very nice, and sounds Japanese. Jerzy Karczmarczuk Caen, Rfance

Re: rounding in haskell

our perception of real numbers can clash with > the (entirely sensible) mechanics of floating-point arithmetic. Still, I prefer to get -5.551115123125783e-17 than 1.5e-08, especially if the "standard" specification says that the system is using doubles. Jerzy Karczmarczuk

Re: rounding in haskell

LE_PRECISION 0 Perhaps you would recommend that I abandon using Windows...? Jerzy Karczmarczuk Caen, France.

Re: rounding in haskell

s for real numbers? (Perhaps it has been done already, and I am behind, in this case I apologize) Jerzy Karczmarczuk Caen, France.

Re: More on randoms

his discussion since the beginning, so I might try to break an open door. The question is the following: would it be a bad idea to provide a 'randomize' primitive, generating an unexpected random value based on the internal clock or other system properties? I haven't seen that here. It *is* useful. Jerzy Karczmarczuk Caen, France

More on randoms

buted >over the whole range of Int (from minBound to maxBound, >inclusive). > > If that clarification were made, there would be no need to > introduce the `genRange' method that Simon P-J suggested. No, please, *no clarification*, but *sound and sane generators

Unevaluated worlds

se the word "nasty"?!). The World must be really implemented, and even if you provide to the Functional User the strict minimum of knowledge, there exist people who know much more than speculators, people who really put their fingers into the implementation, as Mark Jones or Lennart.

"Main" reasoning

*without* IO, without writing a program containing Main, because it will not execute... (And you don't even need Haskell, this is true in "C" as well). (And I remind you that in your incriminated statement you did not say anything about "Haskell program", but "i

Re: Haskell & Clean

Main.main. Well, I see what you mean, no way, NO means, etc. So, the program below in Hugs would not work as it should? Too bad... -- === -- ioio.hs dump f = readFile f >>= putStr gimmeThat = dump "ioio.hs" -- === Jerzy Karczmarczuk Caen, France

On Haskell and Freedom

not come, I sincerely hope. Do you know what is the most crazy and annoiyng feature of the communist system |*in this context*!|?? Well, the answer is: they work as hell to find the "correct" way to distribute goods, and they don't give a damn about producing them... Jerzy Karczmarczuk Caen, France

Re: Clean and Haskell

d contribute to its development. Personally I find much more harmful, and even strongly disgusting if not worse, but the appropriate swearwords I know only in Polish..., those funny fellows who patent *algorithms*. Especially algorithms developed during their work in an educational institution. Jerzy Karczmarczuk Caen, France

Re: Clean and Haskell

appreciate offensive nonsense on this list and elsewhere. Please don't behave as a Yahoo, in the meaning of http://www.jaffebros.com/lee/gulliver/bk4/index.html (especially Chapter VIII). Jerzy Karczmarczuk Caen, France.

Ray tracing again

t. It has some nice features, but as it is considered to be a conpetitor, I should not elaborate upon this theme, because the Haskell list gurus will electrocute me/// Jerzy Karczmarczuk Caen, France

Re: Inverse function (and ray tracing)

fuzzy objects, to cast shadows in an easy way (not necessarily super efficiently, but easy to program, in fact there is nothing to do...), to play with a textured light sources etc. The underlying models might be very nicely represented functionally, but the RT engine seems unfortunately out of this game. Jerzy Karczmarczuk Caen, France

Re: Dynamic scopes in Haskell

tc. will not work. I did it, I introduced such classes as AdditiveGroup, Monoid, Ring, Field, etc., getting rid of Num and its friends, and I passed a few very bad nights. Jerzy Karczmarczuk Caen, France. PS. Caeterum censeo, categoria Num delendam esse puto!!

Re: Dynamic scopes in Haskell

s define add flagSet x y = ...-- your addition function-- and then overload x+y = add myCurrentEnv x y in this module. (I can't resist complaining once more about the inadequacy of the Num class hierarchy in Haskell ...; one will have to do the same in the Rational or Floating instance definitions, which is clumsy). Jerzy Karczmarczuk Caen, France

Re: Scientific uses of Haskell?

tructions in Scheme in the context of constraint programming. Jerzy Karczmarczuk Caen, France.

Haskell and Computer Algebra

typical user wants that typing "x+x" gives "2x", and "x-y" where y was assigned x, should give zero. No question about typing, no questions about 'what is x' in fun = function(x) ... x(bonjour) ... end; followed by "fun(allons*enfants+x);" Jerzy Karczmarczuk Caen, France

Scientific uses of Haskell?

n't really know. I have seen the thesis of Hideki John Reekie (and another one, farther from FP, of Choi). If you know anything about the functional approach to dataflow, please let me know. Jerzy Karczmarczuk, Caen, France

Some Cleaning

t to have it changed...), but I use Clean as well, I don't see any real sense in sweeping it out because it is "proprietary". Jerzy Karczmarczuk Caen, France

How to murder a cat

is possible to repeat the standard imperative archetypic codes functionally, because it is not very rewarding. Sorry for bothering you with my pseudopedagoguerese. Jerzy Karczmarczuk Caen, France.

  1   2   >