command line tools installed.
Thanks!
Simon T.
Simon Thompson | Professor of Logic and Computation
School of Computing | University of Kent | Canterbury, CT2 7NF, UK
s.j.thomp...@kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt
___
Haskell
yourself, or wait for a new release.
On May 30, 2013 3:04 PM, Simon Thompson s.j.thomp...@kent.ac.uk wrote:
Simon Thompson | Professor of Logic and Computation
School of Computing | University of Kent | Canterbury, CT2 7NF, UK
s.j.thomp...@kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt
There's still time to submit a tutorial proposal for Commercial Users of
Functional Programming in Boston …
http://cufp.org/cufp2013-call-tutorials
Simon Thompson | Professor of Logic and Computation
School of Computing | University of Kent | Canterbury, CT2 7NF, UK
s.j.thomp...@kent.ac.uk
to be
provided by the meeting?
and should be sent by email to
- Francesco Cesarini: france...@erlang-solutions.com
- Simon Thompson: s.j.thomp...@kent.ac.uk
by 31 March 2013.
Simon Thompson | Professor of Logic and Computation
School of Computing | University of Kent | Canterbury, CT2 7NF, UK
, outputs to stdout, and repeats this process until
EOF? Should I be thinking of every iteration as a separate program?
Simon Thompson | Professor of Logic and Computation
School of Computing | University of Kent | Canterbury, CT2 7NF, UK
s.j.thomp...@kent.ac.uk | M +44 7986 085754 | W
(and often the
definitions too).
Simon
On 16 Oct 2012, at 20:14, David Thomas davidleotho...@gmail.com wrote:
class Monad m where
return :: a - m a
kleisli :: (a - m b) - (b - m c) - (a - m c)
Simon Thompson | Professor of Logic and Computation
School of Computing | University of Kent
any questions about the position, or would like to discuss it
informally, please contact me by email.
Simon Thompson
Simon Thompson | Professor of Logic and Computation
School of Computing | University of Kent | Canterbury, CT2 7NF, UK
s.j.thomp...@kent.ac.uk | M +44 7986 085754 | W
Thompson, Michael Sperber
CUFP tutorials organisers
More information …
Abstract
Pure functional programming is about programming with expressions rather than
actions, data rather than control. Many programs are more naturally expressed
in this way, and functional programs are often an order
Rigo, UNICAMP
* Sergio Soares, UFPE
* Simon Thompson, Univ. of Kent
* Varmo Vene, Univ. de Tartu
Simon Thompson | Professor of Logic and Computation
School of Computing | University of Kent | Canterbury, CT2 7NF, UK
s.j.thomp...@kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt
=jjid=36123newlang=1
Closing date: 1/4/12, interviews: 30/4/12
If you have any questions do get in touch.
Regards.
Simon
Simon Thompson | Professor of Logic and Computation
School of Computing | University of Kent | Canterbury, CT2 7NF, UK
s.j.thomp...@kent.ac.uk | M +44 7986 085754 | W
of Montreal
Ralf Hinze, University of Oxford
Shriram Krishnamurthi, Brown University
Michel Mauny, ENSTA Paris Tech
James McKinna, UK
Marco T. Morazan, Seton Hall University
Rinus Plasmeijer, Radboud University Nijmegen
Simon Thompson, University of Kent
Important Dates
May 20submission
, UFPE
* Peter Mosses, Swansea University
* Qiu Zongyang, Beijing University
* Rafael Dueire Lins, UFPE
* Renato Cerqueira, PUC-Rio
* Ricardo Massa, UFPE
* Roberto S. Bigonha, UFMG
* Roberto Ierusalimschy, PUC-Rio
* Sandro Rigo, UNICAMP
* Sergio Soares, UFPE
* Simon Thompson, Univ. of Kent
* Varmo
Thompson | Professor of Logic and Computation
School of Computing | University of Kent | Canterbury, CT2 7NF, UK
s.j.thomp...@kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
and Termination Analyzer for ABS
Simon Thompson | Professor of Logic and Computation
School of Computing | University of Kent | Canterbury, CT2 7NF, UK
s.j.thomp...@kent.ac.uk | M +44 7986 085754 | W www.cs.kent.ac.uk/~sjt
___
Haskell-Cafe mailing list
(University of Sussex, UK)
Program Chairs
- Oleg Kiselyov (Monterey, CA, USA)
- Simon Thompson (University of Kent, UK)
Program Committee Members
- Emilie Balland (INRIA, France)
- Ewen Denney (NASA Ames Research Center, USA)
- Martin Erwig (Oregon State University, USA)
- Sebastian Fischer (National
I did some work years ago about giving a predicate logic treatment of Haskell,
based on earlier work for Miranda, and formalised some proofs based on this in
Isabelle. Here are the links:
Logic for Miranda, revisited [from Formal Aspects of Computing, 1995]
)
* Peter Mosses, Swansea University
* Renato Cerqueira, PUC-Rio
* Ricardo Massa, UFPE
* Roberto S. Bigonha, UFMG (TBC)
* Roberto Ierusalimschy, PUC-Rio
* Sandro Rigo, UNICAMP
* Sergio Soares, UFPE (TBC)
* Sergiu Dascalu, Univ. of Nevada
* Simon Thompson, Univ. of Kent
* Sophia Drossopoulou, Imperial
Just updated: list of books for review in the journal of functional
programming, available here:
http://www.cs.kent.ac.uk/people/staff/sjt/JFP/available.html
Regards
Simon T.___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Has anyone successfully compiled Pugs with GHC 6.12? The Pugs page suggests
that it compiles, but it falls to link (and therefore build) when I try it.
Thanks!
Simon T.___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hi John,
Very nice work! As it happens, Dafydd Harries and I wrote another native
implementation of the D-Bus protocol, but yours is much more complete,
and the documentation/commentary is ace. A refreshing change from the
daily pain of libdbus and dbus-glib... :-)
I'm looking at modifying
On Sun, Oct 25, 2009 at 4:51 PM, Michael Snoyman mich...@snoyman.com wrote:
Comments are most welcome. I would like this to be a suitable replacement
for the ubiquitous Maybe, (Either String) and ad-hoc Result data types so
often used to report a failure. I'd be very happy to improve the
On Tue, Dec 16, 2008 at 9:47 PM, Jeff Wheeler j...@nokrev.com wrote:
[1]: http://media.nokrev.com/junk/haskell-logos/logo1.png
[2]: http://media.nokrev.com/junk/haskell-logos/logo2.png
Oops, I meant to post on list.
If you play with the angles and vary the stroke thicknesses you'll
probably
My $0.02 us:
Apologies for ascii art, and hopefully gmail doesn't munge this:
\\ \\
\\ \\ \|
\\ \\ ---
\\ \\
// / \
// / \ \|
// / /\\ ---
Hi,
For the (probably small) set of people who are interested both in D-Bus
and in Haskell, I'm pleased to announce the first release of Bustle, a
tool to show diagrams of D-Bus traffic for profiling purposes. It
consists of a small C executable to log traffic, and a Gtk+ application
which draws
http://www.clutter-project.org/
What is the degree-of-difficulty for creating Haskell bindings for Clutter?
Is it simple to extend gtk2hs to cover it? Or has it been done and I just
don't see it?
Thanks.
--
Darrin
___
Haskell-Cafe mailing list
On Wed, Oct 1, 2008 at 4:00 PM, Don Stewart [EMAIL PROTECTED] wrote:
And keep dividing our compiler teams' efforts, while
single-implementation languages conquer :)
Seems like Haskell has a pretty clear story about which is the right
implementation for general purpose use. I don't see a
These category theory intros were new to me. Thought others here might care.
http://golem.ph.utexas.edu/category/2008/08/new_structures_for_physics_i.html
--
Darrin
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Sat, Aug 23, 2008 at 8:41 AM, Johannes Waldmann
[EMAIL PROTECTED] wrote:
(*) that's the main problem I see with Hutton's book
http://www.cs.nott.ac.uk/~gmh/book.htmlhttp://www.cs.nott.ac.uk/%7Egmh/book.html:
it has Declaring types and classes as chapter 10 (of 13 total).
I think that's
On Wed, Jul 23, 2008 at 2:12 AM, Alberto Ruiz [EMAIL PROTECTED] wrote:
$ ghci solve.hs
*Main sol
3 | [-5.511e-2,0.3,0.2776]
I was hoping for rational solutions. If I were a true jedi master I'd
write my own solver, which might be the right thing to do.
On Wed, Jul 23, 2008 at 5:04 AM, Timo B. Hübel [EMAIL PROTECTED] wrote:
Unfortunately we had to drop the direct links to the source code, as the
documentation on Hackage is currently generated without source code. But as
soon as this changes, we will include these links again.
Someone is
I'm stuck on something that I thought would be easy.
I have a matrix and a vector.
module Main where
import Data.Vector.Dense
import Data.Matrix.Dense
import BLAS.Matrix.Solve
m = listMatrix (2, 3) ([1, 2, 3, 4, 5, 6]::[Double])
v = listVector 2 ([1, 2]::[Double])
main = do ???
Can I
I have a trip coming up and might have some reading time. I was hoping to
get through some of the classics, bananas and lenses, the essence, etc.
So I have a few questions:
Bananas and lenses et. al. uses some notation that I don't understand right
out of the gate. Is there a good primer on
2008/6/23 Abhay Parvate [EMAIL PROTECTED]:
Hello,
You might already know this, but in case you don't: there is another
literate style:
I had trouble finding the docs on this, as I expected them to be in
the ghc user guide. For the record, the relevant docs are in the h98
report:
2008/6/13 Jeff Polakow [EMAIL PROTECTED]:
There will be a talk on Fortress ( a new OO/Functional language from Sun) on
Wednesday June 25 at 6:30pm in Manhattan.
Sounds interesting. Any plans to post video?
--
Darrin
___
Haskell-Cafe mailing list
Cabal-install is looking good. It now, for the record, has only two
deps outside of Cabal-1.4.
I installed cabal-install-0.5 on ubuntu with the haskell.org linux
binary for ghc 6.8.2.
I then tried cabal-install yi
Got this output:
... many successful installs ...
Registering vty-3.0.1...
On Wed, Jun 4, 2008 at 7:48 PM, Duncan Coutts
[EMAIL PROTECTED] wrote:
On Wed, 2008-06-04 at 17:22 +0200, Achim Schneider wrote:
The question, IMHO, seems to be
How would a package manager for a posix-compilant kinetic look like?
http://nixos.org/index.html
How well does that coexist
On Wed, Jun 4, 2008 at 10:14 AM, Claus Reinke [EMAIL PROTECTED] wrote:
- it isn't sufficient to worry about installation management,
one has to worry about integration, lifetime and uninstall
management as well. in short, maintain the dependency
graphs over any of
On Sun, Jun 1, 2008 at 2:44 PM, Bertram Felgenhauer
[EMAIL PROTECTED] wrote:
Hi,
I'm pleased to announce yet another tool for importing darcs repositories
to git. Unlike darcs2git [1] and darcs-to-git [2], it's written in
Haskell, on top of the darcs2 source code. The result is a much faster
I thought that I should be able to write something like the toHtml
function below with pure H98, but when I went to write it I ended up
needing fundeps. Is there a way to express this without using any
extensions?
The idea was to take a remotely Dom-like tree and flatten it into a
string, but not
On Thu, May 29, 2008 at 11:47 AM, Neil Mitchell [EMAIL PROTECTED] wrote:
, a cabal-inst that can install from darcs (or at least from
a local directory)
Yes, that would be lovely!
While we're on the subject, why does searchpath get as little
attention as it does? It seems to work reasonably
On Thu, May 29, 2008 at 4:31 PM, Thomas Hartman [EMAIL PROTECTED] wrote:
I've been playing a lot with searchpath lately, for doing happs
quickstart installation as described on happs.org.
Searchpath works great when it works, which usually means -- when the
module map file is up to date and
2008/5/28 Clifford Beshers [EMAIL PROTECTED]:
But if you say it that way, you get kicked out of the cabal.
I thought the first rule was There is no cabal. Oh wait, that's
Debian. Oh wait... aa!
--
Darrin
___
Haskell-Cafe mailing list
On Tue, May 27, 2008 at 3:40 PM, Kim-Ee Yeoh [EMAIL PROTECTED] wrote:
Let's fill in the type variable: (x - x) - (Char, Bool) ==
forall x. (x - x) - (Char, Bool) == x_t - (x - x) - (Char, Bool),
where x_t is the hidden type-variable, not unlike the reader monad.
As you've pointed out, callER
On Tue, May 13, 2008 at 2:20 AM, Don Stewart [EMAIL PROTECTED] wrote:
Note the use of strict pairs. Key to ensuring the accumulators end up in
registers.The performance difference here is due to fold (and all left
folds) not fusing in normal build/foldr fusion.
The vector version
On Thu, May 8, 2008 at 2:59 AM, Benjamin L. Russell
[EMAIL PROTECTED] wrote:
* Kees Doets and Jan van Eijck: The Haskell Road to Logic, Maths and
Programming,
As someone approaching haskell with very rusty math skills, this book
has been invaluable. My haskell skills are (mostly) beyond what
2008/5/8 Donnie Jones [EMAIL PROTECTED]:
I would be interested to see an article on Haskell in the same light as this
Ocaml article, aka a constructive criticism of Haskell.
http://www.drmaciver.com/2008/02/tell-us-why-your-language-sucks/
--
Darrin
I just merged my work with Taru Karttunen's; you probably want to
% darcs get http://code.haskell.org/hfuse/
The API is a tad different to the one in my old repository; I had some
kind of pointless MVar state threading in my branch which I wrote on a
whim but which isn't particularly useful,
On 15/03/08 03:10, Austin Seipp wrote:
I've tested it on 6.8 and it works fine (Will has 6.6 I believe,) and
the HelloFS example should work, but it is still under development
(notably I believe him mentioning that the BindFS example
has a deadlock issue at the moment.) Testing out that
On Sat, Oct 06, 2007 at 01:26:18PM -0500, Alex Tarkovsky wrote:
...and the silliness continues:
In which case:
http://pics.livejournal.com/resiak/pic/00019kx6/
Will
signature.asc
Description: Digital signature
___
Haskell-Cafe mailing list
idea. Does representing the adjacency list as a flat array cause any problems?
Sarah
--
--
/ __+ / Sarah Thompson /
/ (_ _ _ _ |_ /* /
/ __)(_|| (_|| ) / [EMAIL PROTECTED
complexity should effectively be O(N + N log N + N + N log N + N) which of course just collapses to O(N log N).
--
--
/ __+ / Sarah Thompson /
/ (_ _ _ _ |_ /* /
/ __)(_|| (_|| ) / [EMAIL PROTECTED
I'm replying to two threads at the same time and cross posting my reply,
because they are very relevant to each other. I'm sorry if anyone here ends
up seeing this more than once as a consequence.
[s]
--
Sarah
Did you get this problem sorted out?
Not directly. I ended up building an
I've noticed some interesting behaviour:
Prelude Control.Exception try (return (error e))
Prelude Control.Exception it
Right *** Exception: e
It would appear that when the result of this function is evaluated, the
exception fires during evaluation, after the try is out of scope. I suppose
it
Your COM wrapper code probably behaves differently because the error is
not evoked at the very top level. Note that `seq` (and hence ($!)) only
force evaluation to weak head normal form, which essentially means only
enough to determine the top-level constructor. You may need to evaluate
Hi again,
A slightly harder problem this time. I want to implement something that
looks something like the Microsoft XML parser. This is a very COM heavy
contraption that provides an interface that looks to client applications
like a tree of COM objects that reflects the internal structure of an
I need to convert Ints to Strings and vice-versa. What's the best
way to do
this? I've not found library functions for this.
Read and Show. Hmm... should have tried that before posting. :)
My second question about integer division still stands, however.
Thanks,
Sarah
56 matches
Mail list logo
