Hi,
and/or visual programming (Visual Basic,...)
I can only assume you are a) joking
a bit, yes
, or b) not a visual basic user.
also true
While Visual Basic is a much insulted language, I have a soft spot for
it. However, its not a Visual programming language - its a
Hi,
Henning Thielemann wrote:
assembly language (Assembler ist deutsch :-)
for mysterious reasons it entered the English world.
3GLs: programming based on algorithms (C, Java, ...)
4GSs: domain-specific languages (SQL,...)
5GLs: automatic problem solving (Mathematica, Prolog,...)
Hi,
an experienced person at our lab told me that the classification
into generations has become unfashioned in the last decade;
thus I think I will stay away from using it but argue with
concrete abstraction features.
Concerning the point someone made about the features of Haskell:
* pattern
Hi,
Henning Thielemann wrote:
...
The notation
[f x | x - xs]
describes operations on list elements, and looks like the imperative
forall x in xs do f x,
whereas
map f xs
is a list transformation. The second one is more abstract, isn't it?
for that simple example yes, but what's about
Hi,
because Template Haskell is a compile-time metaprogramming language,
there is no metaprogram
left after the first stage. Thus, it does not make sense, conceptually,
to have more than one stage.
In contrast, in MetaOCaml, you can generate code at run time that
generates code at run time
-
Please accept our apologies if you have received multiple copies.
Please feel free to distribute it to those who might be interested.
-
moved to haskell-cafe
Ketil E.g. way back, I wrote a simple differential equation solver.
Ketil Now, the same function *could* have been applied to vector
Ketil functions, except that I'd have to decide on how to implement
Ketil all the "Num" stuff that really didn't fit well.
Hello,
Bryan == Bryan Hayes (Hayes Technologies)
[EMAIL PROTECTED] writes:
Bryan My question is:
Bryan Does Haskell principally not need pointers (i.e. in case of 2
Bryan data structures needing to reference an other very large data
Bryan structure) or is this a design flaw or
Hi Haskellers,
Bernard == Bernard James POPE [EMAIL PROTECTED] writes:
Bernard Handling functions is always going to be hard. Actually, a
Bernard related issue in Haskell is what do you do with partially
Bernard evaluated structures? Certainly in some circumstances you
Bernard
Hi,
JiJie 20) append' x:xs y = [(init x:xs)] ++ [(tail xs)++[y]]
function application (blank) binds stronger than :,
thus you should write
append' (x:xs) y = ...
Cheers
--
Christoph
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
To make it short:
Main let append' xs y = init xs ++ [last xs ++ [y]]
This works for the three given examples but maybe incorrect
for the task you have in mind, e.g., if xs is empty.
Main append' [ [1, 2], [3, 4], [5] ] 6
[[1,2],[3,4],[5,6]]
Main append' [ ['1', '2'], ['3'] ] '4'
[12,34]
Main
Hi Pavel,
pavel == pavel [EMAIL PROTECTED] writes:
pavel My task is to write a parser for some language (TSG).
pavel ...
pavel Why should I use that do thing? What is so magical in it?
pavel PS: Please, don't say that I'm stupid, I just have problem
pavel with
12 matches
Mail list logo
