> On 7 Dec 2018, at 6:47 pm, Jonathan Lange wrote:
>
> In particular, her suggestion about pairing guidelines for respectful
> communications with guidelines for what to do when things break down is an
> excellent one, and has worked well in other communities to help those on the
> fringes of
=
ACM SIGPLAN CALL FOR SUBMISSIONS
Haskell Symposium 2015
Vancouver, Canada, 3-4 September 2015, directly after ICFP
http://www.haskell.org/haskell-symposium/2015
- Tohoku University
Edward Kmett - McGraw Hill Financial
Neelakantan Krishnaswami - University of Birmingham
Ben Lippmeier (chair)- Vertigo Technology
Hai (Paul) Liu - Intel Labs
Garrett Morris - University of Edinburgh
Dominic Orcha
ppalachian State University
Oleg Kiselyov- Tohoku University
Edward Kmett - McGraw Hill Financial
Neelakantan Krishnaswami - University of Birmingham
Ben Lippmeier (chair)- Vertigo Technology
Hai (Paul) Liu - Intel Labs
Garrett Morris
Dear Haskell Hackers,
I have started an advice page for people that plan to submit experience reports
to the upcoming Haskell Symposium, based on my experience as a PC member last
year:
http://www.haskell.org/haskellwiki/HaskellSymposium/ExperienceReports
Haskell Symposium experience report a
release:
Tran Ma- LLVM aliasing and constancy meta-data.
Amos Robinson - Rewrite rule system and program transforms.
Erik de Castro Lopo- Build framework.
Ben Lippmeier - Code generators, framework, program transforms.
Full release notes:
http
On 06/12/2012, at 3:56 , Simon Peyton-Jones wrote:
> Particularly valuable are offers to take responsibility for a
> particular area (eg the LLVM code generator, or the FFI). I'm
> hoping that this sea change will prove to be quite empowering,
> with GHC becoming more and more a community projec
The Disciplined Disciple Compiler (DDC) is being stripped down, cleaned and
rebuilt with 100% less known bugs and unfortunate holes. The first pieces are
now ready for human consumption, namely a new core language and interpreter for
it.
There is a tutorial including Hackage links here:
htt
(Portland State University)
* Ben Lippmeier - co-chair (University of New South Wales)
* Andres Loeh (Well-Typed LLP)
* Oleg Lobachev(University of Marburg)
* Neil Mitchell - co-chair (Standard Chartered)
* Dimitrios
(Portland State University)
* Ben Lippmeier - co-chair (University of New South Wales)
* Andres Loeh (Well-Typed LLP)
* Oleg Lobachev(University of Marburg)
* Neil Mitchell - co-chair (Standard Chartered)
* Dimitrios
(Portland State University)
* Ben Lippmeier - co-chair (University of New South Wales)
* Andres Loeh (Well-Typed LLP)
* Oleg Lobachev(University of Marburg)
* Neil Mitchell - co-chair (Standard Chartered)
* Dimitrios
The blog is at:
http://disciple-devel.blogspot.com/
more about the project here:
http://trac.haskell.org/ddc/
Ben.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Gloss hides the pain of drawing simple vector graphics behind a nice data type
and a few display functions. Gloss uses OpenGL and GLUT under the hood, but you
won't have to worry about any of that. Get something cool on the screen in
under 10 minutes.
A simple animated example is:
import G
Hi All,
I'm pleased to announce the initial alpha release
of the Disciplined Disciple Compiler (DDC).
Disciple is an explicitly lazy dialect of Haskell which includes:
- first class destructive update of arbitrary data.
- computational effects without the need for state monads.
- type directed fi
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)}".
print ("a: " ++ readLn ++ "\nb: " ++ readLn)
two
Wolfgang,
I thing that Eugenio Moggi was the first to combine monads from category
theory with the lambda calculus.
Check out:
Computational Lambda Calculus and Monads, Eugenio Moggi, 1988
http://www.disi.unige.it/person/MoggiE/
It's citeseer page is at:
http://citeseer.ist.psu.edu/275817.htm
Gary Morris wrote:
ioexptmod :: Integer -> Integer -> Integer -> Int -> IO Integer
ioexptmod base expt n keySize = return $! exptmod base expt n keySize
My hope was that the use
of $! would force it to compute the exponentiation while I was timing
-- and the average times are around 30K cl
I thought the "lazy functional languages are great for implicit
parallelism" thing died out some time ago - at least as far as running
the programs on conventional hardware is concerned.
Designing an algorithm that breaks apart a "sequential" lazy program
into parallel chunks of the appropriate
Ha!,
What you've done is redefine the (+) function.. try 10 + 30 and see what
you get.
Your local definition shadows the "real" (+) function defined in the
prelude.
let a + b = 3
is equivalent to
let (+) a b = 3
...
Jinwoo Lee wrote:
Hi,
I'm a Haskell newbie.
I was trying several things with GH
Kevin,
The problem is that on Windows, GHC statically links the program with
the libgmp library, which has an LGPL license. The LGPL license says
that we can distribute the executable under our own terms, [...]
You could write a C wrapper around a run-time loaded library. Cygwin
supports dlopen()
20 matches
Mail list logo
