# Assistant or Associate Professor of Software Technology
Do you want to work in our programming languages and compiler group,
to help create next generation programming languages? Then apply to
be an Assistant or Associate Professor of Software Technology. The
Software Science department is
positions in
Functional Programming. The candidates will join the Intelligent
Systems group, working with Johan Jeuring, Gabriele Keller, and
Wouter Swierstra.
Besides research, the successful candidate will be expected to
help supervise MSc students and assist in the teaching of
courses.
The positions
evaluation;
* generalized algebraic data types;
* type families and type-level programming;
* concurrency and parallelism.
The summer school consists of a mix of lectures, labs, and a busy
social program.
## Lecturers
Utrecht staff:
* Gabriele Keller
* Trevor McDonell
* Wouter Swierstra
Dear all,
With a heavy heart, I would like to inform you that Doaitse
Swierstra passed away last week. After a period of illness over
the last half year, he had an unfortunate fall at home that
ultimately proved to be fatal.
Doaitse was a remarkable character and a passionate advocate for
The department of Information and Computing Sciences of Utrecht
University is looking for:
6 talented Assistant Professors in Information and Computing
Sciences (Tenure Track 0.8 - 1.0 FTE) (Female/Male), including one
Westerdijk fellowship (Female)
We have a strong tradition of research
* Doaitse Swierstra
* Wouter Swierstra
Guest lectures:
* Simon Marlow (Concurrency and parallelism)
* Luite Stegeman (GHCJS)
## PREREQUISITES
We expect students to have a basic familiarity with Haskell
already. You should be able to write recursive functions over
algebraic data types
of your technical writing skills.
Application closes on September 7th. You can apply through the
University's website:
http://bit.ly/2abk3pe
---
Contact
---
For further information you can direct your inquiries to:
Wouter Swierstra
e-mail: w.s.swiers...@uu.nl.
Anja Volk
, calculation, or construction of programs.
# Program Committee
- James Chapman, University of Strathclyde (co-chair)
- Wouter Swierstra, University of Utrecht (co-chair)
- David Christiansen, Indiana University
- Pierre-Evariste Dagand, LIP6
- Richard Eisenberg, University of Pennsylvania
programs;
- tools, IDEs, or testing tools exploiting type information;
- pearls, being elegant, instructive examples of types used in the
derivation, calculation, or construction of programs.
# Program Committee
- James Chapman, University of Strathclyde (co-chair)
- Wouter Swierstra
-
CALL FOR PAPERS
JFP Special Issue
on
Dependently typed Programming
Submission Deadline: January
Dybjer
pet...@chalmers.se
Chalmers University of Technology
Sweden
Wouter Swierstra
w.s.swiers...@uu.nl
Universiteit Utrecht
The Netherlands
-
___
Haskell mailing list
Haskell
travel and accommodation):
http://www.icfpconference.org/icfp2014/local.html
I hope to see you in Gothenburg!
Wouter Swierstra
Haskell 2014 Program Chair
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo
paper; it just might not be today. All the best,
Wouter Swierstra
Haskell Symposium PC chair
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Bruno Oliveira - University of Hong Kong
Lee Pike - Galois
Josef Svenningsson - Chalmers University of Technology
Wouter Swierstra - University of Utrecht (chair)
Simon Thompson - University of Kent
___
Haskell mailing list
Haskell@haskell.org
http
.
Application closes on the May 30th, 2014. You can apply through
the University's website:
http://ssl1.peoplexs.com/Peoplexs22/CandidatesPortalNoLogin/Vacancy.cfm?PortalID=4124VacatureID=654004
---
Contact
---
For further information you can direct your inquiries to:
Wouter
Oliveira - University of Hong Kong
Lee Pike - Galois
Josef Svenningsson - Chalmers University of Technology
Wouter Swierstra - University of Utrecht (chair)
Simon Thompson - University of Kent
___
Haskell mailing list
Haskell@haskell.org
http
. Andrews
* Publicity Chair:
Wouter Swierstra, Utrecht University
* Video Chair:
Malcolm Wallace, Standard Chartered Bank
* Student Research Competition Chair:
Doaitse Swierstra, Utrecht University
. Andrews
* Publicity Chair:
Wouter Swierstra, Utrecht University
* Video Chair:
Malcolm Wallace, Standard Chartered Bank
* Student Research Competition Chair:
Doaitse Swierstra, Utrecht University
, University of St. Andrews
* Publicity Chair:
Wouter Swierstra, Utrecht University
* Video Chair:
Malcolm Wallace, Standard Chartered Bank
* Student Research Competition Chair:
Doaitse Swierstra, Utrecht University
, University of St. Andrews
* Publicity Chair:
Wouter Swierstra, Utrecht University
* Video Chair:
Malcolm Wallace, Standard Chartered Bank
* Student Research Competition Chair:
Doaitse Swierstra, Utrecht University
=
Student Research Competition
Associated with the
The 17th ACM SIGPLAN International Conference
on Functional Programming (ICFP 2012) and
=
Student Research Competition
Associated with the
The 17th ACM SIGPLAN International Conference
on Functional Programming (ICFP 2012) and
=
ICFP 2012: International Conference on Functional Programming
Copenhagen, Denmark, September 9 - 15, 2012
http://www.icfpconference.org/icfp2012
=
=
ICFP 2012: International Conference on Functional Programming
Copenhagen, Denmark, September 9 - 15, 2012
http://www.icfpconference.org/icfp2012
=
CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS
ICFP 2012
17th ACM SIGPLAN International Conference on Functional Programming
September 9 - 15, 2012
Copenhagen, Denmark
CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS
ICFP 2012
17th ACM SIGPLAN International Conference on Functional Programming
September 9 - 15, 2012
Copenhagen, Denmark
* Workshop Co-Chairs:
Gabriele Keller, University of New South Wales
Derek Dreyer, MPI-SWS
* Programming Contest Chair:
Eijiro Sumii, Tohoku University
* Publicity Chair:
Wouter Swierstra, Radboud Universiteit Nijmegen
* Workshop Co-Chairs:
Gabriele Keller, University of New South Wales
Derek Dreyer, MPI-SWS
* Programming Contest Chair:
Eijiro Sumii, Tohoku University
* Publicity Chair:
Wouter Swierstra, Radboud Universiteit Nijmegen
in Economic Modelling
See you in Nijmegen,
Ana Bove, Chalmers, Sweden
Matthieu Sozeau, INRIA, France
Wouter Swierstra, Radboud University, The Netherlands
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
June 2011: Notification of acceptance
27 August 2011: DTP workshop
* Program Committee *
Ana Bove, Chalmers, Sweden
Matthieu Sozeau, INRIA, France
Wouter Swierstra, Radboud University, The Netherlands
___
Haskell mailing list
Haskell@haskell.org
Given the fairly recent severe earthquake and tsunami in Japan, you
may wonder how this affects the preparations for ICFP'11 in Tokyo.
Luckily, Tokyo was significantly less affected by these saddening
events than the regions further north. In fact, the situation in
Tokyo is almost back to
Given the fairly recent severe earthquake and tsunami in Japan, you
may wonder how this affects the preparations for ICFP'11 in Tokyo.
Luckily, Tokyo was significantly less affected by these saddening
events than the regions further north. In fact, the situation in
Tokyo is almost back to
deadline
25 June 2011: Notification of acceptance
27 August 2911: DTP workshop
* Program Committee *
Ana Bove, Chalmers, Sweden
Matthieu Sozeau, INRIA, France
Wouter Swierstra, Radboud University, The Netherlands
___
Haskell mailing list
Haskell
thoughts go out to the victims of this tragedy.
Wouter Swierstra
ICFP Publicity Chair
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
thoughts go out to the victims of this tragedy.
Wouter Swierstra
ICFP Publicity Chair
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
=
Second Call for Papers
ICFP 2011: International Conference on Functional Programming
Tokyo, Japan, Monday 19 -- Wednesday 21 September 2011
http://www.icfpconference.org/icfp2011
=
Second Call for Papers
ICFP 2011: International Conference on Functional Programming
Tokyo, Japan, Monday 19 -- Wednesday 21 September 2011
http://www.icfpconference.org/icfp2011
=
Call for Papers
ICFP 2011: International Conference on Functional Programming
Tokyo, Japan, Monday 19 -- Wednesday 21 September 2011
http://www.icfpconference.org/icfp2011
=
Call for Papers
ICFP 2011: International Conference on Functional Programming
Tokyo, Japan, Monday 19 -- Wednesday 21 September 2011
http://www.icfpconference.org/icfp2011
CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS
ICFP 2011
16th ACM SIGPLAN International Conference on Functional Programming
September 19 - 21, 2011
Tokyo, Japan
CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS
ICFP 2011
16th ACM SIGPLAN International Conference on Functional Programming
September 19 - 21, 2011
Tokyo, Japan
(Galois Inc.)
James McKinna (Radboud University)
Stefan Monnier(Université de Montréal)
Greg Morrisett(Harvard University)
Christine Paulin-Mohring (Université Paris-Sud)
Wouter Swierstra (Radboud University Nijmegen , co-chair)
Tachio
for Software Systems
Christopher Stone, Harvey Mudd College
* Programming Contest Chair:
Johannes Waldmann, Hochschule für Technik, Wirtschaft und Kultur, Leipzig
* Video Chair:
Scott Smith, Johns Hopkins University
* Publicity Chair:
Wouter Swierstra, Vector Fabrics
for Software Systems
Christopher Stone, Harvey Mudd College
* Programming Contest Chair:
Johannes Waldmann, Hochschule für Technik, Wirtschaft und Kultur, Leipzig
* Video Chair:
Scott Smith, Johns Hopkins University
* Publicity Chair:
Wouter Swierstra, Vector Fabrics
Can some one please give me a suggestion on the best choice for an
embedded
scripting Language for a haskell application?
Why not use Haskell itself? I agree that C and Java aren't perhaps the
best choice for application scripting – but both Xmonad and Yi have
had quite some success using
Good, we need more functional programmers actually solving real
problems. But please put your skills to work in an industry other
than investment banking.
There are lots of companies outside of investment-banking using
functional programming.
Bluespec, Galois, TypLab, are all serious Haskell
In 2007, 2008, and 2009 the fees have been shown on the entry site to the
registration process. This year, the fees are not shown in the online form
before entering personal details (but they are shown on the PDF form.)
Very well. I've added an additional link to the PDF from the main ICFP
Hi Sebastian, cc-Haskell,
1. The early registration deadline is August 30th, that is, one day before
the special rate hotel booking deadline. You can see this (only?) after
starting the registration process.
I've added a link to make this more clear from the main ICFP 2010 page. Thanks
for
* September 25:
Workshop on Mechanizing Metatheory (WMM)
Workshop on High-Level Parallel Programming and Applications (HLPP)
Hmm, what happened to MSFP? http://cs.ioc.ee/msfp/msfp2010/index2.html ?
Of course, there's also the ACM SIGPLAN Workshop on Mathematically
Structured
Institute for Software Systems
Christopher Stone, Harvey Mudd College
* Programming Contest Chair:
Johannes Waldmann, Hochschule für Technik, Wirtschaft und Kultur, Leipzig
* Video Chair:
Scott Smith, Johns Hopkins University
* Publicity Chair:
Wouter Swierstra, Vector
Institute for Software Systems
Christopher Stone, Harvey Mudd College
* Programming Contest Chair:
Johannes Waldmann, Hochschule für Technik, Wirtschaft und Kultur, Leipzig
* Video Chair:
Scott Smith, Johns Hopkins University
* Publicity Chair:
Wouter Swierstra, Vector
This year's ICFP Programming Contest will begin on June 18th (12:00
Noon GMT) and will run till June 21st (12:00 Noon GMT). As in the
previous editions, this is your chance to show that your favorite
programming language is better than all others! The problem statement
and further information will
This year's ICFP Programming Contest will begin on June 18th (12:00
Noon GMT) and will run till June 21st (12:00 Noon GMT). As in the
previous editions, this is your chance to show that your favorite
programming language is better than all others! The problem statement
and further information will
Hi Iustin, cc-Stephanie,
I submitted a paper for ICFP but the paper checker says: “Margins too
small: text block bigger than maximum 7in x 9in on pages 1–6 by 4–5% in
at least one dimension”.
Now, I've used the standard class file and template, didn't alter any of
the margins/columns
I just thought I'd pass on Stephanie's response, as she couldn't post to the
list:
It looks like the SIGPLAN class file has gotten out of sync with the paper
requirements and
is producing a slightly too large textblock. I just checked the template
(filled out with random text)
against the
On behalf of Stephanie Weirich, this year's PC Chair, I would like to
emphasize that the deadline for ICFP this year is at *14:00 UTC*. You
may want to double check what time this is using the following link:
=
Final Call for Papers
ICFP 2010: International Conference on Functional Programming
Baltimore, Maryland, 27 -- 29 September 2010
http://www.icfpconference.org/icfp2010
=
Final Call for Papers
ICFP 2010: International Conference on Functional Programming
Baltimore, Maryland, 27 -- 29 September 2010
http://www.icfpconference.org/icfp2010
=
Second Call for Papers
ICFP 2010: International Conference on Functional Programming
Baltimore, Maryland, 27 -- 29 September 2010
http://www.icfpconference.org/icfp2010
=
Second Call for Papers
ICFP 2010: International Conference on Functional Programming
Baltimore, Maryland, 27 -- 29 September 2010
http://www.icfpconference.org/icfp2010
Hi John,
I threw something together fairly quickly and would like some feedback before
tossing it on Hackage.
I'd really appreciate if some one would:
make sure the code looks goodish (127 lines with full docs)
make sure my tests look saneish
A similar structure is used in XMonad where
CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS
ICFP 2010
15th ACM SIGPLAN International Conference on Functional Programming
September 27 - 29, 2010
Baltimore, Maryland
http://www.icfpconference.org/icfp2010
CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS
ICFP 2010
15th ACM SIGPLAN International Conference on Functional Programming
September 27 - 29, 2010
Baltimore, Maryland
http://www.icfpconference.org/icfp2010
=
Call for Papers
ICFP 2010: International Conference on Functional Programming
Baltimore, Maryland, 27 -- 29 September 2010
http://www.icfpconference.org/icfp2010
=
Call for Papers
ICFP 2010: International Conference on Functional Programming
Baltimore, Maryland, 27 -- 29 September 2010
http://www.icfpconference.org/icfp2010
1) What's the difference between your:
tail ~(Cons _ xs) = xs
and the more simple:
tailStrict (Cons _ xs) = xs ?
I'm no expert - but I can't think of any difference at all.
2) Why don't you also use an irrefutable pattern in take? take is
now defined as:
This is a trickier question: should
I'm happy to announce a new release of the Data.Stream library.
http://hackage.haskell.org/package/Stream
The only change with the previous version has been to add irrefutable
patterns to several function definitions. This is rather delicate
design decision: too many irrefutable patterns
Hi Maciej,
insTree t [] = [t]
insTree t ts@(t':ts')
| rank t rank t' = t : ts
| otherwise = insTree (link t t') ts'
In a way, it's unsurprising that this is where your code breaks. What
you're doing here is using a boolean guard to determine where to
insert. The problem is that ghc's
On 7 Oct 2009, at 23:39, John Velman wrote:
For anyone following this: The XCode ld script is complex, and has
mac
specific defaults early in the search path specification, and I
probably
don't want to change these. A library in a default path is the wrong
libgmp.[dylib | a].
Is there
I am happy to announce that videos of all talks at ICFP and some of
the associated workshops this year have made available online:
http://www.vimeo.com/user2191865/albums
I'm sure you'll join me in thanking Malcolm Wallace for the time and
effort he put into making this possible. Thank you
I am happy to announce that videos of all talks at ICFP and some of
the associated workshops this year have made available online:
http://www.vimeo.com/user2191865/albums
I'm sure you'll join me in thanking Malcolm Wallace for the time and
effort he put into making this possible. Thank you
Dear all,
After several years at the helm, I've decided to step down as editor
of the Monad.Reader.
I am happy to announce that Brent Yorgey will take over my role as
editor. I'd like to take this opportunity to thank Brent for helping
to keep the Monad.Reader alive. I'm sure he'll do a
Dear all,
After several years at the helm, I've decided to step down as editor
of the Monad.Reader.
I am happy to announce that Brent Yorgey will take over my role as
editor. I'd like to take this opportunity to thank Brent for helping
to keep the Monad.Reader alive. I'm sure he'll do a
Dear all,
I am pleased to announce that a new issue of The Monad.Reader is now
available:
http://themonadreader.wordpress.com/
Issue 14 consists of the following three articles:
* Fun with Morse Code
by Heinrich Apfelmus
* Hieroglyph 2: Purely Functional Information Graphics
Would you be so kind as to elaborate?
Sure. I'll just sketch how to deal the example in your e-mail. If you
want to use recursive data types (like Lists or Trees), you'll need to
use the Expr data type from the paper.
Instead of defining:
data Foo = One | Two | Three | Four
Define the
Hi Brian,
If I understand you correctly, you've run into the Expression
Problem. Phil Wadler posed the problem in a widely-cited e-mail,
formulating it much more clearly than I ever could:
http://homepages.inf.ed.ac.uk/wadler/papers/expression/expression.txt
There are lots of ways to
The idea is that fs accepts a polymorphic function as its argument.
What type signature can I specify for f in order to compile this code?
As you said yourself, you need to add a type signature to fs:
{-# LANGUAGE RankNTypes #-}
fs :: ((forall a . ((a, a) - a)) - t) - (t, t)
fs g = (g
On 3 Jun 2009, at 20:49, Corey O'Connor wrote:
I'm interested in the feasibility of extending the compiler using a
construct similar to type synonym families to determine runtime
representation and evaluation strategy for types. Can anybody point me
to existing work in this area?
You may
Call for Copy
The Monad.Reader - Issue 14
Please consider writing something for the next issue of The
Monad.Reader. The deadline for Issue 14 is:
** May 15, 2009 **
The Monad.Reader is a electronic magazine about all things
Call for Copy
The Monad.Reader - Issue 14
Please consider writing something for the next issue of The
Monad.Reader. The deadline for Issue 14 is:
** May 15, 2009 **
The Monad.Reader is a electronic magazine about all things
If I use :info (-) I get information on the binary minus. Is unary
minus also a function?
You can define it yourself or use negate from the Prelude.
Wouter
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I am wondering about how to give a correctness prove of a simple
parsing
algorithm. I tried to think of a simple example but even in this
case I
don't know how.
I'm not sure I understand your question, but I'm guessing you're
looking for general techniques for the formal verification of
What is the suggested (if any) convention for inserting an interactive
session in the documentation?
You may want to look at:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/DocTest
Wouter
___
Haskell-Cafe mailing list
Hi Ben,
But this definition coincides with his definition of the greatest
fixpoint
In Haskell the least and greatest fixed points coincide.
(Categorically, this is called algebraically compact I think). You
can still fake coinductive types to some degree by consistently
using unfolds
I am pleased to announce that a new issue of The Monad.Reader is now
available:
http://www.haskell.org/haskellwiki/The_Monad.Reader
The Monad.Reader is a quarterly magazine about functional programming.
Issue 13 consists of the following four articles:
* Stephen Hicks
Rapid
I've set both limits to 20MiB, and switched off MediaWiki's warning.
I've uploaded Wouter's file to [[Image:TMR-Issue13.pdf]].
Fantastic! Thanks for all your help,
Wouter
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I am pleased to announce that a new issue of The Monad.Reader is now
available:
http://www.haskell.org/haskellwiki/The_Monad.Reader
The Monad.Reader is a quarterly magazine about functional programming.
Issue 13 consists of the following four articles:
* Stephen Hicks
Rapid
I can't manage to upload files to the Haskell wiki. I've tried
different browsers, different internet connections, different
machines, different operating systems, and different user accounts -
all without success. Is this a new anti-spam measure?
This is slightly annoying. I was looking
This could look like:
module Integer where
..
theorem read_parses_what_show_shows :
(a :: Integer, Show a, Read a) =
show . read a = id a
proof
axiom
There are several problems with this approach.
For example, I can show:
const 0 (head []) = 0
But if I pretend that I don't
Unfortunately the proofs in dependently typed languages are
extremely long and tedious to write. Some kind of compiler proofing
tool could ease the pain, but I do not think it has low enough
complexity for a GSoC project.
I wouldn't say that.
Here's the complete proof script in Coq
I've released a new version of the Data.Stream package, a modest
library for manipulating infinite lists.
Changes include:
* Support for lazy SmallCheck;
* Improved Show instance;
* Stricter scans;
* Various documentation fixes;
* Several new functions from Data.List.
Many of these
snip
How about using Data.Monoid:
down = downPar `mappend` downNew `mappend` downTrans
Wouter
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
At the risk of painting my own bikeshed...
If you're learning Haskell, which communicates the idea more clearly:
* Appendable
or
* Monoid
Would you call function composition (on endofunctions) appending?
The join of a monad? A semi-colon (as in sequencing two imperative
statements)?
Call for Copy
The Monad.Reader - Issue 13
Please consider writing an article for the next issue of the
Monad.Reader. The deadline for the next issue is:
** February 13, 2009 **
* Submission Details *
Get in touch with me if you
The biggest wart is that view is not a total function; the compiler
needs to be extra careful to only call it on types that are instances
of View. I wonder if there is a good way to solve this problem?
The usual way to solve this is to define a data type corresponding to
all the types in
I am pleased to announce that a new issue of The Monad.Reader is now
available:
http://www.haskell.org/haskellwiki/The_Monad.Reader
Issue 12 is another Summer of Code special and consists of the
following three articles:
* Max Bolingbroke
Compiler Development Made Easy
* Roman
Hi Ryan,
On 19 Nov 2008, at 04:39, Ryan Ingram wrote:
In HOAS, a lambda expression in the target language is represented
by a function in the source language:
data ExpE t where
ApE :: ExpE (a - b) - ExpE a - ExpE b
LamE :: (ExpE a - ExpE b) - ExpE (a - b)
But without a way to inspect
I am pleased to announce that a new issue of The Monad.Reader is now
available:
http://www.haskell.org/haskellwiki/The_Monad.Reader
Issue 12 is another Summer of Code special and consists of the
following three articles:
* Max Bolingbroke
Compiler Development Made Easy
* Roman
Call for Copy
The Monad.Reader - Issue 13
You may want to pencil in the deadline for the next Monad.Reader:
** February 13, 2009 **
And in case you missed it, Issue 11 was released a few weeks ago with
the following three articles:
*
I am pleased to announce that a new issue of The Monad.Reader is now
available:
http://www.haskell.org/haskellwiki/The_Monad.Reader
Issue 11 consists of the following three articles:
* David F. Place
How to Refold a Map
* Kenneth Knowles
First-Order Logic a la Carte
*
1 - 100 of 161 matches
Mail list logo
