[Please forward to anyone who might be interested! Thanks! Kevin]
The School of Computer Science is looking to recruit new academics as part of a
large on-going expansion of our academic staff. We wish to appoint two new
Lecturers/Senior Lecturers (depending on experience) to join our vibrant
-andrews.ac.uk/csblog/2016/05/30/fixed-term-lectureships-in-computer-science/
for details.
Best Wishes,
Kevin
PS If you are sending mail to k...@cs.st-andrews.ac.uk, you may get a bounce
message. I should still have received your email despite the error message.
For future mail, the best and most
[Please forward to suitable candidates. Thanks! Kevin.]
The School of Computer Science at the University of St Andrews has several
fully funded research scholarships available. These are available
to UK residents (possibly also to EU nationals), and pay fees as well as
maintenance. There is
[Please forward to suitable candidates. Thanks! Kevin.]
We have eight funded research scholarships available under the University of St
Andrews Seventh Century scheme.
These are open to students from any country, and pay fees as well as
maintenance. The deadline for applications is March
31st
[Haskellers definitely welcome! Kevin]
EAPLS PhD Award 2013: Call for Nominations
URL: http://eapls.org/pages/phd_award/
Since a few years, the European Association for Programming Languages and
Systems has established a Best Dissertation Award in the
cs.st-andrews.ac.uk/csblog/2012/12/20/600th-anniversary-phd-scholarships/
Best Wishes,
Kevin
----
Kevin Hammond, Professor of Computer Science, University of St Andrews
T: +44-1334 463241 F: +44-1334-463278W: http://www.cs.st-andrews.ac.uk/~kh
In accordance with University poli
candidate!
https://www.vacancies.st-andrews.ac.uk//ViewVacancy.aspx?enc=mEgrBL4XQK0+ld8aNkwYmP7j9uKB0Q3XDyDQqVA9vP1JLwBKRtw4rNHXJis9NOK7tfyZGpjmqWuqi2gq2EDJAA==
Best Wishes,
Kevin
Kevin Hammond, Professor of Computer Science, University of St Andrews
T: +44-1334 463241 F: +44-1334
-research-studentships/
Further information about my research at http://www.cs.st-andrews.ac.uk/~kh
Best Wishes,
Kevin
Kevin Hammond, Professor of Computer Science, University of St Andrews
T: +44-1334 463241 F: +44-1334-463278W: http://www.cs.st-andrews.ac.uk/~kh
In
XQK0+ld8aNkwYmP7D3yeHoB9dq9Dt8SMhc7cfUxfhJ58X6raNR5cTUYvkanff/dwFskrjS/F1/tjVhMXlercjuOzAVXJSU2QI6m44N7QfERRWTwdyGo9ahO4t
Best Wishes,
Kevin
----
Kevin Hammond, Professor of Computer Science, University of St Andrews
T: +44-1334 463241 F: +44-1334-463278W: http://www.cs.st-andrews.ac.uk/~kh
In accordance
abstraction or complex systems engineering themes.
Best Wishes,
Kevin
Kevin Hammond, Professor of Computer Science, University of St Andrews
T: +44-1334 463241 F: +44-1334-463278W: http://www.cs.st-andrews.ac.uk/~kh
In accordance with University policy on electronic mail, this
there is in fact a range.
Best Wishes,
Kevin
University of St Andrews, School of Computer Science
=
Postdoctoral Research Fellow in Worst-Case Execution Time Analysis
for Embedded Software
Salary - £26,915+ pa(*)
Applications are invited from well
[With apologies in advance for any duplication. Kevin]
THIRD & FINAL CALL FOR PAPERS
TFP 2005 <http://www.tifp.org/tfp05>: Sixth
Symposium on Trends in Functional Programming,
September 23rd-24th 2005, Tallinn, Estonia
(co-located with ICFP 2005 and GPCE 2005).
Deadline for sub
or another EU country and be resident in the EU).
We would obviously welcome applications from those who were
interested in functional programming
and Haskell. General school information below. Note that time is limited!
Kevin Hammond, Roy Dyckhoff and James McKinna
Postgraduate Places for
[With apologies in advance for any duplication. Kevin]
Heriot-Watt University, School of Mathematical & Computer Sciences/
University of St Andrews, School of Computer Science
Two Postdoctoral Research Positions in Embedded
Software for Visual Sensing on Autonomous Vehicles
£21
[With apologies in advance for any duplication. Kevin]
SECOND CALL FOR PAPERS
TFP 2005 <http://www.tifp.org/tfp05>: Sixth
Symposium on Trends in Functional Programming,
September 23rd-24th 2005, Tallinn, Estonia
(co-located with ICFP 2005 and GPCE 2005).
Deadline for submiss
[With apologies in advance for any duplication. Kevin]
FIRST CALL FOR PAPERS
TFP 2005 <http://www.tifp.org/tfp05>: Sixth
Symposium on Trends in Functional Programming,
September 23rd-24th 2005, Tallinn, Estonia
(co-located with ICFP 2005 and GPCE 2005).
The 2005 Symposium on Tre
University of St Andrews
As part of an ongoing programme of expansion, applications are
invited for the following posts in Computer Science.
2 Chairs ()
You should have an outstanding international record of research and
publication or the equivalent industrial experience. The new Chairs
will p
I just posted a new version of FG, my Arrows GUI Library Based on GTK+.
You can find it at http://kevin.atkinson.dhs.org/fg/. I reworked how
Events are handled which decreases the number of times a loop is
traversed form "2^d" to "d + 1" where d is the depth of the inner most
loop. Furtherm
On Sat, 19 Mar 2005 [EMAIL PROTECTED] wrote:
> On Sat, Mar 19, 2005 at 07:48:09AM -0700, Kevin Atkinson wrote:
> > Has anyone tried to make Fudgets an instance of the Arrow class?
>
> see the stream processors in John Hughes's original paper.
I will have a closer look.
>
On Sat, 19 Mar 2005, David Menendez wrote:
> Kevin Atkinson writes:
>
> >
> > What follows is my first attempt of using Arrows to create a GUI
> > Library based on GTK+. It uses many ideas from Fruit
> > (http://haskell.org/fruit/). However it is based on dis
On Sat, 19 Mar 2005 [EMAIL PROTECTED] wrote:
> On Fri, Mar 18, 2005 at 07:18:29PM -0700, Kevin Atkinson wrote:
> > What follows is my first attempt of using Arrows to create a GUI Library
> > based on GTK+. It uses many ideas from Fruit (http://haskell.org/fruit/).
> > H
) 2005 by Kevin Atkinson under the GNU LGPL license
-- version 2.0 or 2.1. You should have received a copy of the LGPL
-- license along with this library if you did not you can find
-- it at http://www.gnu.org/
{-|
This module is a first attempt of using Arrows to create a GUI Library
based on GTK
becomes quite clear
> from the point-free way to write it, while still not so obvious in the
> pointwise version.
I haven't proven it, but I think that this is the same function on lists:
> flist = (. return) . ap
-- Kevin
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
f
avoiding the problem by dynamically linking with libgmp on Windows?
Any help would be greatly appreciated!
Kevin
Kevin Backhouse
ARM Limited, 110 Fulbourn Road, Cambridge, CB1 9NJ, UK.
Tel: +44 1223 400601
This e-mail message is intended for the addressee(s) only and may
contain informati
-andrews.ac.uk/news/jobs.php
Application forms are available at
http://www.st-andrews.ac.uk/hr/recruitment/vacancies
Best Wishes,
Kevin
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
On Tuesday, December 30, 2003 3:10 PM, Ben Rudiak-Gould
[SMTP:[EMAIL PROTECTED] wrote:
> Interesting.
>
> This still violates referential transparency, though. (c 'get)
returns
> a value or errors out depending on whether (c 'set) has been called
yet.
Oh, sure. I didn't mean to quibble with th
On Tuesday, December 30, 2003 12:39 PM, Ben Rudiak-Gould
[SMTP:[EMAIL PROTECTED] wrote:
>
> With letrec and unrestricted call/cc you can implement ML-style refs:
With an *implementation of letrec that uses mutation* and unrestricted
call/cc, you can implement ML-style ref cells:
Petite Chez Sch
an't find any other references.
>
> Yeah, it seems to have disappeared off the face of the Internet (quite a
> feat). Emailing Daan Leijen may produce something.
Archive.org to the rescue!
http://web.archive.org/web/20030314040306/http://www.c
On Friday, February 07, 2003 7:41 AM, Arjan van IJzendoorn
[SMTP:[EMAIL PROTECTED]] wrote:
> The quality of the messages, however, is not as good as I would have
> expected. I am a beginning Scheme programmer ...
Then you should have set the language to "Beginning Student" or
"Beginning Student w
ment lazy evaluation in other
languages. It's not very pleasant if you write a lot of lazy code,
because you have to explicitly suspend evaluation of values using
delay and explicitly demand evaluation using force.
Thus, we have lazy languages that make the laziness implicit.
--
Kevin S. Mill
= \c -> c 1 (\c -> c 2 nil)
How about just:
cons hd tl = \ c -> c hd tl
then we could write the usual accessors:
head xs = xs (\ hd tl -> hd)
tail xs = xs (\ hd tl -> tl)
This is a very, very old idea.
--
Kevin S. Millikin Architecture Technology Corporation
Research Scient
r
to early SASL implementations here at St Andrews. In many ways, he was
a true functional programming pioneer.
I am sure you will back my action in expressing the condolences of the
entire international community to Tony's family.
Kevin
___
Haske
2TH AUGUST 2002.
Note that faxed or posted
applications will be accepted by the university, but email ones will not.
We expect to conduct interviews for the post during the second part of August.
If you have any questions, please do feel free to contact either of
us informally
about the post.
Dear friends,
Although final confirmation is awaited, Kevin Hammond and Steve Linton expect
shortly to be in a position to advertise a three year post-doctoral fellowship
to work on a research project entitled: "Computational Algebra for Commodity
Parallel Machines".
The goal of th
And in the olden days (Before Haskell) there was:
Kewley and Glynn1989
J.M. Kewley and K. Glynn.
Evaluation Annotations for Hope+.
In Glasgow Workshop on Functional Programming, Workshops in Computing, pages
329-337, Fraserburgh, Scotland, 1989. Springer-Verlag.
k
Robert Enna
Looking at the online GHC Users Guide, this flag is documented in
4.19.14. Individual optimisations
This has a link to Section 4.11.2, but -fall-strict isn't described in
that section. Presumably its only been half removed (added) from the
documentation.
k
Simon Marlow writes:
> > On
[Apologies for any duplication. Please can you distribute to those who
might be interested...
I am global chair of topic 10, Parallel Programming: Models, Methods and
Programming
Languages, and would welcome submissions from the Haskell community.
Kevin]
* Euro-Par 2002 - http
-fp.dcs.st-and.ac.uk/hume
Please address informal enquiries to [EMAIL PROTECTED]
The project is funded by the UK's Engineering and Physical Sciences
Research Council (EPSRC).
The prototype implementation is written in Haskell. We hope to make it
available to
interested parties in due course!
o, Msc.
Yes, we can let you have the sources (there are two different versions, one
with spheres
originally written in Id, the other is the one derived from Caliban).
Hans-Wolfgang Loidl is
probably the best contact, failing which I will look through my own archives.
Be
acceptable if there is a good reason. Further
details are available at.
http://www.dcs.st-and.ac.uk/jobs/#lec
or send me email if you'd like to discuss it. The salary is on the
standard UK Lecturer scale:
currently UK pounds 18,731 to 30,967
Best Wishes,
I don't believe this says anything about support for other OS's. I
think the devices here are hardware, (PCs, handhelds, phones, fridge
interfaces, ...) Of course Microsoft believes that some day, very
soon, all devices will run (a version of) Windows. Hence this
statement refers to Microsoft
programmer
here! Advertisement attached. Please note the closing date of
June 30th.
Best Wishes,
Kevin
Lectureship in Computer Science UK pounds 17,238 - 30,065 per annum
You should have a PhD in Computer Science, or equivalent,
and demonstrate exceptional research potential and teaching
space leak, but it may give some pointers (hehe!).
Hope this helps,
Kevin
[With apologies if you receive multiple emails from different lists. Kevin
and Greg]
NEW BOOK ANNOUNCEMENT
Research Directions in Parallel Functional Programming
Kevin Hammond and Greg Michaelson (Editors)
Special Features include:
* This is the first comprehensive book available on this
. No, changing collages is not an option.
Then maybe in a few years I can actually sound like I know what I am
talking about ;)
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
eness identifying
that the user will never have to explicitly mark anything as unique
except in the case where its communication to the outside work. Ie IO
etc. Thus one can write non-destructive array updating programs that
would without an uniqueness type system be horribly inefficient (but
easy to verify as being correct) but with a uniqueness type system will
fast and easy to verify. Can you ask for more?
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
iddle) for twiddling the order about.
>
> Maybe we could adopt that as normal usage?
Interesting however I like (.| and $|) since it represents a unix pipe.
The ~ tilde is generally used for not.
My guess is that it is not in the standard becuase we can't agree on which
one is best.
---
o have
haskell-future - for dission of future verions of haskell as
Frank A. Christoph suggested (although he used
name haskell2)
---
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
Marcin 'Qrczak' Kowalczyk wrote:
>
> Tue, 5 Oct 1999 14:10:26 -0400 (EDT), Kevin Atkinson <[EMAIL PROTECTED]> pisze:
>
> > 1) Dynamic types. You can't cast up. That is you can't recover the
> > original type from an object in a existential
On Wed, 6 Oct 1999, Simon Peyton-Jones wrote:
> Kevin writes:
>
> | I strongly agree that Haskell can become a *much* more
> | powerful language
> | with out losing any of clean syntax or semantics. However,
> | when ever I
> | bring up limitations of Haskell type
Alex Ferguson wrote:
>
> Kevin Atkinson:
>
> > I have a generic mutable array class which has a few basic methods:
> >
> > class MArray ... where
> > newArray :: Int -> m (mutArray st el)
> > write :: mutArray st el -> Int -> el -&g
If you
> can write a preprocessor to do the conversion, then it's up to
> the people who write the compilers to offer it or not.
Preprocessors are a mess and a good language will not need it.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
Alex Ferguson wrote:
>
> Kevin Atkinson, replying to me...
>
> > > > - True ad-doc polymorphism
> > > > - Built in dynamic typing system
> > > > - State Encapsulation
> > > > - A solution to the abilities arising from multi parameter
Alex Ferguson wrote:
>
> Kevin Atkinson:
> > I never, ever, said that I would like Haskell to be able to do
> > everything C++ can.
>
> No, that was my inference from the general drift of your comments.
>
> I also never said that I want Haskell to become a
>
Alex Ferguson wrote:
>
> Kevin Atkinson and I argue about C++'s 'Cleaner more natural syntax':
> > I would like to be able to do the things in Haskell that I can do in C++
> > but currently Haskell's type system is too simple to allow me to do
> > the
aner language for OO as that what
it is based around. When I think of them I will send some examples to
this list.
Once again:
Haskell for *most* things has far cleaner syntax than just about any
other language out there. However, OO is not one of them.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
and fell that making it any more
powerful than it is will ruin it. Well if that is truly how most people
fell I am just wasting my time with Haskell and should just go back to
using C++ with all its flaws, and never grace the presence of any
Haskell user again.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
va. Although many OO things can be done in Haskell C++ and Java
syntax is more natural more doing OO.
---
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
On Tue, 5 Oct 1999, Juergen Pfitzenmaier wrote:
> Kevin Atkinson wrote:
> > Even through most problems don't truly fit in the OO paradigm, OO
> > still is extremely useful. GUI are a prime example of what OO is good
> > for.
> point given. GUI are an area where OO
On Tue, 5 Oct 1999, Theo Norvell wrote:
> On Tue, 5 Oct 1999, Kevin Atkinson wrote:
>
> > If there is enough interest I could repost this code as well as an
> > explanation of the many "hacks" I had to due to get around ambiguity
> > arising fro the use of mu
Base
virtual foo()
do stuff
class Derived, extends Base
foo()
call Base::foo()
doo stuff
3) Encapsulation. You can't have private and protected members. Some
of this can be done using modules. However it is more work.
4) Cleaner more natural syntax.
---
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
On Tue, 5 Oct 1999, Juergen Pfitzenmaier wrote:
> Alex Ferguson wrote:
> > That C++ has a very poor type system.
>
> and Kevin Atkinson wrote in response:
> > You are going to have to justify it as I thing C++ and Java has a VERY
> > good type system minus the implic
On Tue, 5 Oct 1999, Juergen Pfitzenmaier wrote:
> Kevin Atkinson wrote:
> > Do you not like OO at all?
>
> what good is OO for ? ;) OO gives me a framework/language to talk
> about objects (read entities) and claims that with objects programmers
> have the right too
now. Like I said before it was just a general idea of what I was
trying to accomplish.
Perhapes Carlos Camarao de Figueiredo <[EMAIL PROTECTED]>, the author of
"Type Inference for Overloading without Restrictions, Declarations or
Annotations", http://www.dcc.ufmg.br/~camarao, could comment on this one
as resolving those sort of ambiguities, I belive, is part of his paper. (I
have not had a chance to look at in detail as it is quite technical.)
---
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
On Mon, 4 Oct 1999, Joe English wrote:
> Kevin Atkinson wrote:
>
> > "Generic comparison function" is not really what I mean here. What I
> > mean is a single generic union which will have its
> > comparison function default to (==) if one is not spec
On Mon, 4 Oct 1999, Kevin Atkinson wrote:
> I am not going to argue with you any more. We have a different
> definitions of what is easy to read. To me:
>
> union fun list1 list2
>
> ... The union and unionBy
> is not so muc
On Mon, 4 Oct 1999, Manuel M. T. Chakravarty wrote:
> Kevin Atkinson <[EMAIL PROTECTED]> wrote,
>
> > The key word here is excessive. If you are confusing your self by
> > using the same name for everthing than you need to use seperate function
> > names.
"Manuel M. T. Chakravarty" wrote:
>
> Kevin Atkinson <[EMAIL PROTECTED]> wrote,
>
> > I take it that you are happy with names such as:
> >
> [long list of names deleted]
> >
> > I *hate* languages that try to keep things too simple. Which is
At 8:02 pm +0100 28/9/99, Adrian Hey wrote:
>On Mon 27 Sep, Kevin Hammond wrote:
>> It's entirely possible to have a parallel
>> implementation of a language
>> defining serial pattern matching [**], but in which the actual execution is
>> parallel.
>
>Y
Alex Ferguson wrote:
>
> Kevin Atkinson:
> > You have a collection of Shapes. Some of these shapes are circles,
> > however, others are rectangle. Occasionally you will need to extract
> > these specific shapes form the collection of generic shapes as there is no
> &
he past! The problems are soluble,
but not necessarily in a way that most people think is nice.]
Standard disclaimers apply...
Regards,
Kevin
[*] Note that use of terminology does vary in the literature, since
there is some confusion about
these concepts! Many people say "seq
compiler cannot resolve.
> However, the user can add explicit type annotations where necessary
> to resolve the ambiguities. And I find this preferable to making
> the explicit type annotations part of the symbol names, which is
> what I currently tend to do when writing Haskell.
&g
On Mon, 27 Sep 1999, Alex Ferguson wrote:
> Kevin Atkinson, replying to me:
>
> > > If I understand you correctly, then the best way of doing this would be
> > > with existentially (boundedly) quantified data types, currently a
> > > non-standard extention
something that it would be nice to do, on one level:
> occassionally one has to 'monadise' part of one's program, and due to
> the above effect, end up driving a coach and four through the rest of
> one's code.
It has already been done to some extent in other threads.
---
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
*
I *hate* languages that try to keep things too simple. Which is one of
the reasons I *hate* java. Please don't make me *hate* Haskell for the
same reason.
---
Kevin Atkinson [EMAIL PROTECTED] http://metalab.unc.edu/kevina/
On Mon, 27 Sep 1999, George Russell wrote:
> Kevin Atkinson wrote:
> [snip]
> > 1) Support for true ad-hoc overloading.
> [snip]
> > 2) Support for TRUE OO style programming.
> [snip]
> > 4) Being able to write
> > do a <- getLine
> > b &
y) high functions
can make doing the simplest task quite difficult. So the new programmer
will just use the do
This is why I belive in true adhoc overloading.
1) so that you don't have to make up names just reuse the old ones
2) make using standard library functions easier to use because there
will be a lot fewer names to lookup/memorize.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
Arthur Gold wrote:
>
> Though I am _not_ exactly a Haskell expert, I could not avoid
> commenting...
>
> Kevin Atkinson wrote:
> >
> > Here is a laundry list of things I think Haskell still needs. By
> > Haskell here I mean Haskell plus extension that a
provided by the STL is C++.
And the points that are brought up so much that I don't even what to get
into.
6) speed.
7) less memory.
So what do you Haskell experts think.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
division etc. can be found at
http://www-fp.dcs.st-and.ac.uk
or contact me to discuss details.
Kevin
--
Division of Computer Science, Tel: +44-1334 463241 (Direct)
School of Mathematical Fax: +44-1334 463278
and Computational Sciences
In fact, the last I heard, there was no
> Java for Linux!
Just what do you mean by this. The java runtime system has been
available for linux for a very long time.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
n't not the only thing giving latex2html a hard time. I
don't know latex too well as I use LyX most of the time so I wan't sure
where the exact program was. It could be that he used a little bit of
raw TeX...
Also is there some reason the latex source to documents is hardly ever
released?
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
In responce to a slashdot article on "All-Purpose Distributed Computing"
(http://slashdot.org/article.pl?sid=99/08/09/1214204) I wrote:
I hate to break this to you but some purely functional programming
languages can already do this [automatically execute programs in
parallel]. Haskell is a La
on any sort of
container. This function needs to be efficient enough so that when
other functions are defined in terms of it there will be nearly as
efficient (within 10% or so) as writing the function directly based on
the structure of the container.
--
Kevin Atkinson
[EMAIL PROTECTED]
http
http://www.sgi.com/Technology/STL/index.html
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
al, I am having some trouble getting rules
to behave. Any help would be appreciated.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
--EF4673DF4E1172F415EEF3AF
Content-Type: text/plain; charset=us-ascii;
name="Opt.hs"
Content-Transfer-Encoding: 7bit
Cont
Kevin Atkinson wrote:
>
> Even though it is possible to define foldl with foldr or vis versa it
> (with the current implantation of Haskell with ghc) not nearly as
> efficient. To demonstrate this consider folding of a range.
>
> import System
>
> foldR f i (a,z) =
n rather than a stack and thus is not
nearly as efficient. However, with proper Optimization I imagine that
foldR2 could be as efficient as foldR. I don't know about foldL2
though.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
code is quite
readable.
Consider
if ... then
{-code-}
else if .. then
{-code-}
else if .. then
{-code-}
else
{-code-}
Which I think almost everyone agrees is better than:
if ... then
{-code-}
else if .. then
{-code-}
else if .. then
{-code-}
else
{-code-}
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
Lennart Augustsson wrote:
>
> Kevin Atkinson wrote:
>
> > Lennart Augustsson wrote:
> >
> > > No, it will not be as efficient. foldr is not the right primitive for making
> > > functions on lists. You want the more general
> > > recurse :: (a
d as this is
the first time I herd of it.
What exactly does it do? What would its defination for a list be.
How would you define a foldl, foldr, foldl1, foldr1, zip, etc.. with it.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
Lennart Augustsson wrote:
>
> Kevin Atkinson wrote:
>
> > Ok you haskell experts. I have an interesting challenge (or maybe just
> > a question if you have seen it before).
> >
> > Is it possible to zip two sequences together with just:
> >
> &
hat those three functions are the ONLY way to
manipulate the abstract container. That is this container has no head,
tail , etc. defined for it.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
Laszlo Nemeth wrote:
>
> Kevin Atkinson wrote:
>
> > cons :: a -> c a -> c a
> > empty :: c
> > foldr :: (a -> b -> b) -> b -> c a -> b
>
> I am not an expert. I have a minor problem with this, the type of
> empty: if c stands
do so.
Remember you may ONLY use the three functions given above and NOTHING
else. Creating a list with "foldr (:) []" is also not allowed.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
if i then return EQ else do
i <- x <=~ y
if i then return LT else do
return GT
which is a bit uglier.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
This is a multi-part message in MIME format.
--D60EAED940B337DE04784023
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Kevin Atkinson wrote:
> The file Main.hs contains a small test script demonstrating how
> PrimArrays can be faster than array
s.tar.
Once again feed back most welcome, especially from the Haskell experts
out on the list.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
--EBB527FEAD30E684DE2E6D05
Content-Type: text/plain; charset=us-ascii;
name="Container.hs"
Content-Transfer-Encodin
is a bug in
ghc or the Haskell 98 report? I prefer hugs behavior over ghc.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
pressions
might be a bit much for a new user.
--
Kevin Atkinson
[EMAIL PROTECTED]
http://metalab.unc.edu/kevina/
1 - 100 of 169 matches
Mail list logo
