The submission deadline for the IFIP TC2/WG2.1 Working Conference on
Generic Programming has been extended until 2nd March 2002.
For further details of the conference, please see the web site at
http://www.cs.uu.nl/~johanj/wcgp/. A revised call for papers is
attached.
Jeremy Gibbons and Johan
price for early
registration; the capacity of the lecture room is limited
and offered on a first-come first-served basis, so early
registration is recommended.
The speakers are as follows:
Chris Okasaki (West Point)
John Hughes (Chalmers)
Jeremy Gibbons (Oxford)
Paul
Gibbons, Oxford University Computing Laboratory, Wolfson
Building, Parks Road, Oxford OX1 3QD, UK, [EMAIL PROTECTED],
www.comlab.ox.ac.uk/oucl/people/jeremy.gibbons.html.
The closing date for applications for both positions is Monday 14th April
2003.
Roland Backhouse
Jeremy Gibbons
--
[EMAIL
COMMITTEE
Roland Backhouse, Stephen Bloom, Eerke Boiten, Jules Desharnais, Thorsten
Ehm, Jeremy Gibbons, Ian Hayes, Eric Hehner, Johan Jeuring, Dexter Kozen
(chair), Rustan Leino, Hans Leiss, Christian Lengauer, Lambert Meertens,
Bernhard Moeller, David Naumann, Alberto Pardo, Georg Struth, Jerzy Tiuryn
. My MPC paper shows Ladner and
Fischer's parallel prefix algorithm. My thesis also shows
Reingold and Tilford's tree-drawing algorithm, which I wrote
up as a later paper [7]. I confess, two examples is not
really many...
Jeremy
[1] Jeremy Gibbons. Algebras for Tree
Algorithms. D. Phil. thesis
. Please follow the link from the conference web
page (URL above).
Note that the early registration deadline is Monday 14th
June. After that date, we cannot guarantee that
accommodation will be available.
(Our apologies if you receive multiple copies of this
announcement.)
Jeremy Gibbons
on behalf
. Accommodation is still available, but places are
limited.
To register, please follow the link from the conference web
page, at the URL above.
(Our apologies if you receive multiple copies of this
announcement.)
Jeremy Gibbons
on behalf of the
MPC programme committee
--
[EMAIL PROTECTED
On Mon, 11 Oct 2004, Serge D. Mechveliani wrote:
How do you think, is the program (1) equivalent to (2)
in the meaning of Haskell-98 ?
Not at all. If foo is non-strict and p partial, (2) may yield a result
where (1) would not. You identify the possibility yourself: (2) is lazier.
(1) (\ x
Despite being a fan of generic programming, I have my doubts about this
kind of automatic lifting. It works fine in ordinary mathematics,
because there is no fear of confusion - one hardly ever deals with
functions as entities in their own right. (Witness sigma sin(x) dx,
involving a term sin(x)
schools.
plug
Don't forget The Fun of Programming (Jeremy Gibbons and Oege de Moor,
editors), which is specifically intended to be a textbook for an
advanced course on functional programming.
http://www.comlab.ox.ac.uk/oucl/work/jeremy.gibbons/publications/
index.html#fop
/plug
Jeremy
[EMAIL
2005. For further
information and details of how to apply, please contact Jim Davies
([EMAIL PROTECTED]) or Jeremy Gibbons
([EMAIL PROTECTED]).
--
[EMAIL PROTECTED]
Oxford University Computing Laboratory,TEL: +44 1865 283508
Wolfson Building, Parks Road, FAX: +44 1865 273839
On Wed, 7 Sep 2005, Frederik Eaton wrote:
I want the type system to be able to do automatic lifting of monads,
i.e., since [] is a monad, I should be able to write the following:
[1,2]+[3,4]
and have it interpreted as do {a-[1,2]; b-[3,4]; return (a+b)}.
You might want to take a look at
On 23 Jan 2006, at 13:33, Johan Jeuring wrote:
JW I'd like to read some overview and comparison on second-level
JW programming in Haskell (and if there is none, I'm willing to
contribute):
This won't be of much help right now, but Ralf Hinze, Andres Loh and I
are preparing lecture notes on
On 13 Jul 2006, at 06:25, Jared Warren wrote:
Haskell's type checking language is a logical programming language.
The canonical logical language is Prolog. However, Idealised Prolog
does not have data structures, and does Peano numbers like:
natural(zero).
natural(x), succ(x,y) :-
Nations University, Macau
Jeremy Gibbons, University of Oxford, UK
Wolfgang Grieskamp, Microsoft Research, Redmond, US
Henri Habrias, University of Nantes, France
Maritta Heisel, University of Magdeburg, Germany
Soon-Kyeong Kim, University of Queensland, Australia
Michel Lemoine, ONERA, Toulouse, France
Hello, Wim. What kind of thing do you have in mind?
I teach a one-week course on Functional Programming (using Haskell,
and aimed at practical application) as part of the part-time
professional Software Engineering Programme at Oxford. It can be
taken on a standalone basis, or as credit
proceedings. All are
welcome, but if you'd like to come, could you please drop me (Jeremy
Gibbons) a line so that I have an idea of numbers?
If you'd like to give a talk, please also propose a title and a duration.
We haven't yet fixed the timetable, because it depends in part on what
offers of talks
UNIVERSITY OF OXFORD
Software Engineering Programme
Kellogg College
THREE UNIVERSITY LECTURERSHIPS IN SOFTWARE ENGINEERING
Applications are invited for three new University Lecturerships in Software
Engineering. The successful applicants will join the staff of the
University's Software
(apologies for any duplicate cross-postings you may receive)
++
23rd British Colloquium for Theoretical Computer Science
BCTCS 2007
2-5 April 2007
--
IFM 2007
Sixth International Conference on Integrated Formal Methods
2nd - 6th July 2007, Oxford, UK
http://www.ifm2007.org
On 2 May 2007, at 12:18, Johannes Waldmann wrote:
If you want to contribute further to the discussion,
then please do so via http://groups.google.com/group/fp-termination
(I don't want to clutter the haskell mailing list,
but I want to have the discussion in some public place.)
Isn't
://www.softeng.ox.ac.uk/Jim.Davies
Jeremy Gibbonshttp://www.softeng.ox.ac.uk/Jeremy.Gibbons
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Many arguments have been had about what it means for a language to be
functional, so that's probably not a productive line of discussion.
(ICFP carefully doesn't stipulate language choice for the programming
contest, for example.)
Both eager and lazy evaluation can be pure, providing
of Kent, UK
Venanzio Capretta University of Nijmegen, Netherlands
Sharon Curtis Oxford Brookes University, UK
Jules DesharnaisUniversité Laval, Québec, Canada
Peter DybjerChalmers University of Technology, Sweden
Jeremy Gibbons University of Oxford, UK
Lindsay
), the Algebra of Programming group at the University of
Oxford (Jeremy Gibbons), and the Mathematically Structured Programming
group at the University of Strathclyde (Neil Ghani and Conor McBride).
We are all familiar with Milner's slogan that well-typed programs
cannot go wrong. Types express
SPRING SCHOOL ON GENERIC AND INDEXED PROGRAMMING
Wadham College, Oxford, 22nd to 26th March 2010
TOPIC
Generic programming is about making programs more widely applicable
via exotic kinds of parametrization - not just along the dimensions of
values or of types, but of things such as the shape
://www.haskell.org/haskell-symposium/2010,
the 2010 Haskell Symposium web page.
* http://www.icfpconference.org/icfp2010,
the ICFP 2010 web page.
Programme Committee
* Jeremy Gibbons, University of Oxford (chair)
* James Cheney, University of Edinburgh
* Duncan
.
* http://www.haskell.org/haskell-symposium/2010,
the 2010 Haskell Symposium web page.
* http://www.icfpconference.org/icfp2010,
the ICFP 2010 web page.
Programme Committee
* Jeremy Gibbons, University of Oxford (chair)
* James Cheney, University of Edinburgh
FULLY-FUNDED DOCTORAL STUDENTSHIP
IN PROGRAMMING LANGUAGES AT OXFORD
I have just obtained funding for a DPhil studentship at Oxford. The
studentship is open in terms of topic; I would welcome applications
for research in any of my areas of interest. These include:
functional programming
) registration page.
Programme Committee
* Jeremy Gibbons, University of Oxford (chair)
* James Cheney, University of Edinburgh
* Duncan Coutts, Well-Typed LLP
* Sharon Curtis, Oxford Brookes University
* Fritz Henglein, Kobenhavns Universitet
* Tom Schrijvers, Katholieke
Please can this discussion be moved to haskell-cafe?
http://www.haskell.org/haskellwiki/Mailing_Lists
Ta.
Jeremy
On 18 Apr 2011, at 12:55, Mike Meyer wrote:
On Mon, 18 Apr 2011 12:56:39 +0200
Ertugrul Soeylemez e...@ertes.de wrote:
Mike Meyer m...@mired.org wrote:
On Mon, 18 Apr 2011
the conference, we plan that the authors of the best papers will
be invited to submit revised versions to a special issue of the Elsevier
journal Science of Computer Programming.
PROGRAMME COMMITTEE
Jeremy Gibbons University of Oxford, UK (co-chair)
Pablo Nogueira Universidad
to submit revised versions to a special issue of the Elsevier
journal Science of Computer Programming.
PROGRAMME COMMITTEE
Jeremy Gibbons University of Oxford, UK (co-chair)
Pablo Nogueira Universidad Politécnica de Madrid, ES (co-chair)
Ralph Back Åbo Akademi, FI
SOCIAL EVENTS
The conference excursion will be a guided tour of Madrid's Royal Palace.
The banquet will be Northern Spanish cuisine at the Sidreria-Asador Gaztemanu.
PROGRAMME COMMITTEE
Jeremy Gibbons University of Oxford, UK (co-chair)
Pablo Nogueira Universidad Politécnica
details of the position are here:
https://www.recruit.ox.ac.uk/pls/hrisliverecruit/erq_jobspec_version_4.display_form
The application closing date is 21st September.
Please feel free to write to me if you have any queries.
Jeremy Gibbons
Professor of Computing
Director of Software Engineering
=103732
The application closing date is 21st September.
Please feel free to write to me if you have any queries.
Jeremy Gibbons
Professor of Computing
Director of Software Engineering Programme
www.cs.ox.ac.uk/jeremy.gibbons
jeremy.gibb...@cs.ox.ac.uk
University of Oxford Department of Computer Science in association with Kellogg
College, Oxford
UNIVERSITY LECTURER IN COMPUTER SCIENCE (SOFTWARE ENGINEERING)
The Department of Computer Science proposes to appoint a University Lecturer in
Computer Science from 1st March 2013 and no later than
University of Oxford Department of Computer Science in association with Kellogg
College, Oxford
UNIVERSITY LECTURERS IN COMPUTER SCIENCE (SOFTWARE ENGINEERING) - THREE POSTS
The Department of Computer Science proposes to appoint three University
Lecturers in Computer Science from 1st April
Publication of proceedings: December 23rd
ORGANIZERS
General chairs:
* Zhiming Liu, United Nations University, MO
* Jens Weber, University of Victoria, CA
Programme chairs:
* Jeremy Gibbons, University of Oxford, UK
* Wendy MacCaull, St. Francis Xavier University, CA
is a
collaboration between Professor Jeremy Gibbons in the Department of Computer
Science, University of Oxford, and Dr Perdita Stevens and Dr James Cheney in
the School of Informatics, University of Edinburgh.
The project concerns bidirectional transformations, which are a means of
maintaining
:
* Zhiming Liu, United Nations University, MO
* Jens Weber, University of Victoria, CA
Programme chairs:
* Jeremy Gibbons, University of Oxford, UK
* Wendy MacCaull, St. Francis Xavier University, CA
Programme committee:
* Ime Asangansi, University of Oslo, NO
* Tom Broens, Mobihealth, NL
* Lori
* Jens Weber, University of Victoria, CA
Programme chairs:
* Jeremy Gibbons, University of Oxford, UK
* Wendy MacCaull, St. Francis Xavier University, CA
Programme committee:
* Ime Asangansi, University of Oslo, NO
* Tom Broens, Mobihealth, NL
* Lori Clarke, University of Massachusetts, US
of Victoria, CA
Programme chairs:
* Jeremy Gibbons, University of Oxford, UK
* Wendy MacCaull, St. Francis Xavier University, CA
Programme committee:
* Ime Asangansi, University of Oslo, NO
* Tom Broens, Mobihealth, NL
* Lori Clarke, University of Massachusetts, US
* David Clifton, University
can be tackled with the categorical methods presented, and numerical ones
(the local optimization techniques), where interval analysis can be used.
The Seminar is organized by:
* Paul Flondor, Professor of Mathematics at Politehnica University Bucharest
(pflon...@yahoo.co.uk)
* Jeremy Gibbons
submit supplementary material (e.g. a full paper, talk
slides) if they desire, which PC members are free (but not expected) to read.
Organization
Program Chairs
Jeremy Gibbons, University of Oxford, United Kingdom
Evelyne Viegas, Microsoft Research, United States
Program Committee
Jeremy Gibbons, University of Oxford, United Kingdom
Evelyne Viegas, Microsoft Research, United States
Program Committee
Soren Auer, University of Bonn, Germany
Nate Foster, Cornell University, United States
Juliana Freire, Polytechnic Institute of New York University, United States
Erik Meijer
Cavalcanti (University of York)
Andrew Butterfield (Trinity College Dublin)
Leo Freitas (Newcastle University)
Jeremy Gibbons (University of Oxford)
Lindsay Groves (Victoria University of Wellington)
Walter Guttmann (University of Canterbury)
Ian Hayes (University of Queensland)
Jeremy Jacob (University
University)
Ana Cavalcanti (University of York)
Andrew Butterfield (Trinity College Dublin)
Leo Freitas (Newcastle University)
Jeremy Gibbons (University of Oxford)
Lindsay Groves (Victoria University of Wellington)
Walter Guttmann (University of Canterbury)
Ian Hayes (University of Queensland)
Jeremy Jacob
*
--- Call For Participation ---
5th International Symposium on Unifying Theories of Programming
Singapore, 13th May, 2014
In association with FM 2014
Dear all,
My department has just received a big award from Google, which will mostly be
spent on DPhil student scholarships. The topic is open to anything the dept
works in, but I would particularly welcome strong students in functional
programming. Please pass this around to anyone you think
(On behalf of Sue Eisenbach, to whom queries should be addressed. Nomination
deadline is 4th Jan. My apologies for the short notice. -jg)
*
Dear all,
If you have a student who has completed an outstanding programming language PhD
thesis in the academic year 2014, can I recommend that the
” project,
working with Jim Davies and Jeremy Gibbons.
The primary selection criteria are strong design and development skills in
object-oriented and functional programming, representation and manipulation of
semi-structured data, and model transformation, together with a proven track
record
DOCTORAL TEACHING ASSISTANTSHIPS
SOFTWARE ENGINEERING PROGRAMME
DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF OXFORD
The University of Oxford's Computer Science department is offering two DPhil
(PhD) scholarships. The scholarships are for up to five years; they include
teaching responsibilities
ASSOCIATE PROFESSORSHIP IN DATA SCIENCE
DEPARTMENT OF CONTINUING EDUCATION
UNIVERSITY OF OXFORD
Grade 36S: £44,620 - £59,914 p.a. (pro rata)
The University is seeking to appoint an Associate Professor in Data Science, to
commence in October 2015 or as soon as possible thereafter. The post will
The Department of Computer Science at University of Oxford has an opening for
an Associate or Full Professorship in Programming Languages, as described
below. Please pass this advert on to anyone who may be interested. I would be
happy to answer any questions. -jg
*
Applications are
Dear All,
I would like to draw your attention to the SIGPLAN John C. Reynolds Doctoral
Dissertation Award. If you are (or will be) a 2015 PhD graduate with a great
thesis or a supervisor of such a graduate can I suggest you consider applying?
Obtaining such an award makes a person stand out
bout academic matters, please contact
any of the organizers:
Faris Abou-Saleh, James Cheney, Jeremy Gibbons, James McKinna, Perdita Stevens
*
jeremy.gibb...@cs.ox.ac.uk
Oxford University Department of Computer Science,
Wolfson Building, Parks Road, Oxford OX1 3QD, UK.
The Dept of CS at Oxford has just advertised up to 15 DPhil (Oxford's PhD)
scholarships to start in Oct 2017. I would be very happy to see applications
from strong students in functional programming among those scholarships. If
you'd like to discuss, please get in touch. In particular, if you
r Partitioning on Meshes of Accelerators* [provisional
title]
Seminar conveners:
[Jeremy Gibbons](http://www.cs.ox.ac.uk/people/jeremy.gibbons/
<http://www.cs.ox.ac.uk/people/jeremy.gibbons/>)
[Peter Braam](https://www.braam.io/ <https://www.braam.io/>)
jeremy.gibb...@cs.ox.ac.uk
otsdam, Germany
Jacques Carette - McMaster University, Canada
Youyou Cong - Tokyo Institute of Technology, Japan
Philippa Cowderoy
Jan de Muijnck-Hughes - University of Glasgow, UK
Harley Eades III - Augusta University, USA
Jeremy G
The purpose of this list is specified on its webpage:
> The Haskell mailing list is for announcements and short discussions on any
> topic related to the Haskell language.
>
> Discussions should be moved to the Haskell Cafe mailing list after a few
> exchanges, so that the volume on this list
Jan 2024
* Final versions due: Wed 28th Feb 2024
*** Organizers ***
Shin-ya Katsumata National Institute of Informatics, JP (General Chair)
Jeremy Gibbons University of Oxford, UK (PC Co-Chair)
Dale Miller INRIA Saclay and LIX/IPP, FR (PC Co-Chair)
Naohiko Hoshino
Dear all,
> ===
> Call For Papers
>
> FLOPS 2024: 17th International Symposium on Functional and Logic Programming
> ===
This is a reminder that the deadline for FLOPS 2024 submissions is rapidly
-v, but
when I tried that it hung my machine and I had to reboot. (I
only have 16M, and Netscape was running, but still...)
Am I doing something obviously wrong?
Jeremy
--
Jeremy Gibbons [EMAIL PROTECTED]
School of Computing and Mathematical Sciences,tel +44 1865 483660
Oxford Brookes Un
The attached script induces panic in GHC6.4.1: ghc-6.4.1: panic! (the
`impossible' happened, GHC version 6.4.1): applyTypeToArgs f{v a1Eg}
x{v a1Ei}.
In case it helps to understand what I was trying to do: this was an
attempt to define an unfold for vectors, a number-parametrized type.
On 12 Dec 2005, at 12:48, Andres Loeh wrote:
The attached script induces panic in GHC6.4.1: ghc-6.4.1: panic! (the
`impossible' happened, GHC version 6.4.1): applyTypeToArgs f{v a1Eg}
x{v a1Ei}.
I think this is related to a known bug, because the same workaround
helps -- annotate the f and x
On Mon, 11 Oct 2004, Serge D. Mechveliani wrote:
How do you think, is the program (1) equivalent to (2)
in the meaning of Haskell-98 ?
Not at all. If foo is non-strict and p partial, (2) may yield a result
where (1) would not. You identify the possibility yourself: (2) is lazier.
(1) (\ x
On 14/08/05, Carl Marks id2359 at yahoo.com wrote:
Is there any text/article which makes precise/rigorous/explicit
the connection between the category theoretic definition of
monad with the haskell implementation?
I did try to do this in my (rejected) paper A monadic
interpretation of tactics
68 matches
Mail list logo
