Related articles |
---|
Practicality of functional and logic languages? benes@dcse.fee.vutbr.cs (Mirek Benes) (1993-01-11) |
Re: Practicality of functional and logic languages? (long) winikoff@cs.mu.OZ.AU (1993-01-14) |
Re: Practicality of functional and logic languages? (long) bromage@mullauna.cs.mu.OZ.AU (1993-01-16) |
Re: Practicality of functional and logic languages? (long) bevan@cs.man.ac.uk (1993-01-16) |
Newsgroups: | comp.compilers |
From: | bevan@cs.man.ac.uk (Stephen J Bevan) |
Organization: | Department of Computer Science, University of Manchester |
Date: | Sat, 16 Jan 1993 17:21:54 GMT |
References: | 93-01-059 93-01-102 |
Keywords: | functional, performance, FTP |
winikoff@cs.mu.OZ.AU (Michael David WINIKOFF) writes:
>What about the power of the functional programming paradigm? Is there an
>important class of problem which cannot be done by Functional Programming?
[ A good Haskell implementation can use single threading to
allow arrays to be updated in place ]
This is true, but Haskell supports monolithic array creation which means
that certain algorithms% can be expressed without requiring
(expensive/difficult) single threading detection. You can also have
imperative (i.e. guaranteed O(1)) arrays in a pure functional language as
long as they are wrapped up using continuations/monads. These allow
another set of problems to be dealt with (see recent messages in
comp.lang.functional).
bevan
% Examples of can be obtained by anonymous ftp from any of :-
ftp.dcs.glasgow.ac.uk, ftp.cs.chalmers.se, nebula.cs.yale.edu
in the directory pub/haskell/library or pub/haskell/library/bevan at
Chalmers (this is the most up to date)
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.