iq/B+IMGPJwugR63L68sBJUS3+i3hCU7JR/EJv31DirWmhwtDXIz2HSywsmfeey5lSxnIg==
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 polic
reliable email address to use is
ke...@kevinhammond.net -please update your address book.
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
made through:
http://www.cs.st-andrews.ac.uk/prospective-pg/research-degrees
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
s possible project ideas. Applications should be
made through:
http://www.cs.st-andrews.ac.uk/prospective-pg/research-degrees
When applying, please indicate that you would like to apply for 7th Century
Funding.
Best Wishes,
Kevin
----
Kevin Hammond, Professor of Computer Science, Univer
Universiteit Nijmegen, The Netherlands
* Giorgio Ghelli, University of Pisa, Italy
* Stefan Gruner, University of Pretoria, South Africa
* Kevin Hammond, University of St Andrews, U.K.
* Martin Hofmann, Ludwig-Maximilians-Universität München, Germany
* Paul Klint, CWI and University of Amsterdam, 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
one year in the
first instance, with a possibility of extension
based on pending funding applications. The start
date will be 1 March 2007, or as soon as possible
thereafter.
Informal enquiries to: Dr Kevin Hammond, email: [EMAIL PROTECTED]
* Salary is subject to confirmation under the new
ce: Friday 10th February 2006 (provisional)
Camera-ready version: Friday 10th March 2006(provisional)
ORGANISATION
Symposium Chair: Kevin
Hammond (University of St. Andrews)
Program Chair: Marko van Eekelen
(Radboud University Nijmegen, NL)
Local Organisation
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
d at:
http://www.hw.ac.uk/hr/v_research.php .
For further details of the StA post please
contact Dr Kevin Hammond ([EMAIL PROTECTED]).
Please quote ref: CD243/05. Application forms
and further particulars are available from Human
Resources, University of St Andrews, College
Gate, North Street
rovisional)
Camera-ready version: Friday 10th March 2006(provisional)
ORGANISATION
Symposium Chair: Kevin
Hammond (University of St. Andrews)
Program Chair: Marko van Eekelen
(Radboud University Nijmegen, NL)
Local Organisation: Tarmo
Uustalu (Institute of Cyberne
r 2005 (provisional)
Submission for formal proceedings: Friday 16th December 2005 (provisional)
Notification of acceptance:Friday 10th February 2006 (provisional)
Camera-ready version: Friday 10th March 2006(provisional)
ORGANISATION
Symposium Chair:Kevin Hammon
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
A reminder that the deadline for application is tomorrow, 28th April.
We have two chairs and two lectureships open to the best candidates.
I would welcome some good functional programmers, of course, and am
happy to answer any questions!
Further details are found at
http://www.dcs.st-andrews.ac.uk
Dear Haskell list member,
It is with regret that I must inform you of the death of Tony Davie,
who passed away on Wednesday, January 9th following a long-standing
battle with leukemia. Many of you who came into contact with him will
have been impressed by his in-depth understanding of his subject
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
[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:/
Applications are invited for a PhD student to work on resource modelling
for Hume, a concurrent bounded resource functional language aimed
at embedded/safety critical systems.
The student must be UK- or EC-resident, and possess a good undergraduate
degree in Computer Science. The project will pa
At 10:02 am -0300 14/6/01, Heron wrote:
>Hello Haskell & GHC people, I need the source code of a Ray
>Tracing written in Haskell. This code was used for parallelization using
>Caliban and Eden. Can you help me on how or where I can obtain it ?
>Heron de Carvalho, Msc.
Yes, we ca
St Andrews University has three lectureships available in Computer Science.
We are
looking for good researchers, with an emphasis on practical skills:
functional programmers
would obviously be very good from my perspective! The deadline is the 22nd
of June, but
a late application may be acceptabl
We have a vacancy for a lecturer in Computer Science at St Andrews.
Our head of school is looking for someone with strengths in
experimental computer science, who will ideally be able to support
our new degree programme in Internet Computing.
Obviously it would be great to have another functional
[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
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
At 1:08 pm +0100 28/9/99, Adrian Hey wrote:
>So, I guess the answer is.. Yes, we do need to let such operational
>issues muddy the waters. What worries me here is that there might be
>some unjustifiable assumptions about the nature of the machine which is
>performing those operations. In particula
[Please forward to anyone who might be interested.]
A vacancy has arisen for an EPSRC (UK government-funded) PhD studentship in
the Division of
Computer Science at the University of St Andrews.
Current research interests in the functional programming group include:
o parallel language design a
[I apologise for polluting the Haskell list with non-technical discussion,
but I hope that we might get some good FP applications for these posts.
As our head of division notes, Computer Science is expanding at St Andrews,
and we are looking for good people to join the division. It would be grea
also like to announce our new WWW site at:
http://www-fp.dcs.st-and.ac.uk/
Some of these pages are still under construction. Please send
comments/suggestions
for improvement to Alvaro ([EMAIL PROTECTED])
Merry Christmas and a Happy New Year,
Kevin Hammond and Alvaro Rebon
arity Analysis for Parallel Functional Programs".
The studentship covers fees and maintenance for 3 years
PhD study in the Division of Computer Science at the University of St Andrews
as part of the functional programming group under the supervision of Dr
Kevin Hammond
(http://www.dcs.st-and.ac.uk/
At 2:40 pm 10/6/98, Simon L Peyton Jones wrote:
>Here's a reasonable design for exceptions in Haskell:
>
>* A value of Haskell type T can be
>EITHER one of the values we know and love
> (bottom, or constructor, or function,
>depending on T),
>
>OR it c
At 3:37 pm 16/3/98, Patrick Logan wrote:
>A discussion about referential transparency and I/O in Haskell popped
>up in Comp.lang.scheme. The example was something like:
>
>do
> x <- getLine
> y <- getLine
>
>...with...
>
>getLine :: IO String
>
>And so my question is what is the value of getLine
le for the next academic year. These are
available
to UK nationals with a good first degree (first-class or upper-second honours)
and are tenable for 3 years' study as above. These studentships may be held
in any area of functional programming under the supervision of either Kevin
Hammond
or To
At 11:09 am 24/11/97, Sigbjorn Finne wrote:
>Olaf Chitil writes:
>> Section 7.1 of the Haskell Report says about the input functions
>> getChar, getLine, getContents, interact, ...:
>>
>> "By default, these input functions echo to standard output. Functions in
>> the I/O library provide full contr
Christian,
In Haskell you can use exitWith :: ExitCode -> IO a from the System library,
so you don't need the program to "return" a "Int" (this is not a
esthetically pleasing in C!). The IO a allows the operation to be used
in any IO monad context, not just IO ().
Regards,
Kevin
At 6:40 pm 21/
e PLILP/ALP/HOA 1997
conferences in
Southampton, UK (September 3-5), and immediately before the annual
Glasgow workshop (we will happily recommend IFL attendees to the
Glasgow organisers on request).
We look forward to seeing you in St Andrews.
Kevin Hammond, Tony Davie and Chris Clack
IFL
be improved!]
We look forward to seeing you in St Andrews.
Kevin Hammond, Tony Davie and Chris Clack
IFL '97 Organising Committee
PS We are cooperating with the functional programming group at Glasgow
with the aim of running IFL "back-to-back" with the (invitation-only)
Simon,
>PS. I'm less steamed up about the stdin issue; but I think you missed
>Sigbjorn's point. Yes stdin is a constant now, but he'd like stdin *not* to
>be a constant, so that he could take a value of type IO () that used stdin,
>and reconnect its stdin to (say) a file.
Fergus Henderson has
ons registering for
PASCO'97 can attend ISSAC'97 talks.
Program Committee
-
Gene Copperman Northeastern University
Wayne Eberly University of Calgary
Tetsuro Fujise Mitsubishi Research Inc.
Kevin HammondUniversity of St. An
PASCO'97 can attend ISSAC'97 talks.
Program Committee
-
Gene Copperman Northeastern University
Wayne Eberly University of Calgary
Tetsuro Fujise Mitsubishi Research Inc.
Kevin HammondUniversity of St. Andrews
Ji
The current draft of the Haskell 1.3 Libraries is now available for public
comment at
ftp://ftp.dcs.st-and.ac.uk/pub/haskell/lib-28-Oct-96.{ps,dvi}
in either PostScript or DVI format (HTML will follow).
The document defines the required libraries for conforming Haskell 1.3
implementatio
Following the recent spate of problem messages to this list, I've been working
with Glasgow to set up a moderated list (this would have been harder
to do in the past). As a subscriber, you should see
essentially no difference except that there is now an automated way to
subscribe/unsubscribe to t
[I didn't want to send *another* junk message, but this is getting out of hand.]
Please, please, could posters refrain from spamming this list ...
The original message was sent in error and the poster has apologised.
If you have ANY message of an administrative nature send it to
haskell-request
> There are two issues going on here.
>
> 1. Should pattern variables be permitted in the guard?
> ^^
> Haskell's reply: yes, but the result is always bottom.
Technically, it's only bottom if the pattern variables are evaluated.
This might seem
> An alternative to allow my second example to match on the third
> clause might be:
> [...]
> where (p',gi') = (p,gi) with variables renamed consistently.
Actually, it isn't necessary to rename in this translation (the
condition was left over from a previous version). Apologies if this
confused
[The issue is the semantics of guards in pattern-bindings. As defined,
they are useless if they use a variable bound in the pattern.]
Brian writes:
> I can't see anything in the report to limit guards to mention only free
> variables, but if pattern variables are used in the guards, big problem
Err, Lennart, doesn't your implementation
a) write C doubles (even for Float)
b) attach extra information to the file
That is in the C sense you don't read/write a raw stream of floats. I
assume that what David wanted was something which would read the stream
of floats
> Hi !
>
> Can anyone tell me whether it's possible to force Haskell to evaluate an
> expression strict ?
Yes, in general it's not possible. That is, I can't write a function
evaluate :: a -> a
which will force its argument to WHNF. I can, as you've noted, write
a function:
e
Sorry for the delay -- I've been away for a week, without good
network connections...
> In regard to asynchronous I/O, you said:
>
> > This applies equally to the request model. Nothing prevents the submission
> > (but not necessarily resolution) of a later I/O request during resolution
> > of a
> Joe,
>
> > Regarding efficiency, can someone comment on whether there is any difference
> > between the stream and continuation models in the effect on parallelism?
>
> Parallelism could be ENHANCED by a suitable continuation I/O model, such as
the
> one I am working on (slowly), since with asy
> Currently, the report says nothing about whether an instance
> of Ix should perform bounds checking, or whether this is done
> automatically by the implementation.
>
> My proposal was to say that it should be in the instance
> declaration, which gives the user a variety of options as to
> how to
> I've got a query about exporting classes and instances from a module.
> In the report (1.2beta) it says that a class and all its methods are exported
> if either it is explicitly named in the export list, or implicitly exported
> if the export list is omited. I don't understand what is sup
Here is our current list of outstanding issues. Unresolved items are
starred. Please let me know ASAP of anything that I've omitted, or
which I've misinterpreted. Joe has the token on the Prelude, but will
send it to Glasgow for integration and checking by Wednesday. We have
the token on all o
> Good. Let me add a disclaimer, though. This appears to me still to be
> LR-parseable (except for the genuine ambiguity), because in the absence of
> arbitrary parenthesization, a finite lookahead is sufficient to distinguish,
> for example,
>
> (n+1) x =
> from
> (n+1) `op` x =
>
>
Joe writes:
> [My simple syntax for LHSes] doesn't cover things like
>
> (f .* g) x y = f (g x y)
and proposes a syntax which is the same as my simple proposal,
but covers exactly this also.
> lhs ::= (var | @(@ ilhs @)@) apat+
> | ilhs
> | pat
>
>
> * Should gd -> exp^0 be changed back to gd -> exp? PROVISIONAL DECISON: no.
> We made this choice at Mark Jones' suggestion, to allow us to write
> e::T Int rather than e::(T Int). (I can't remember why this guard stuff
> is a consequence... No action reqd.
I agree, if we don't do this, then
59 matches
Mail list logo
