The issue of *purity* in Haskell and this thread has confused me.
At value level (not type level) is this linked with *equational reasoning*?
Are the operational semantics of Haskell similar but not the same as
equational logic?
Why are theorem provers such as Haskabelle need?
The following hint code causes GHCi to crash under Windows:
runInterpreter $ loadModules [SomeModule.hs]
The error message is:
GHCi runtime linker: fatal error: I found a duplicate definition for
symbol _hs_gtWord64 whilst processing object file
C:\Programme\Haskell
there is enough experimentally determined about reading in general to
be certain that visible gaps between words materially improves
readability, and internal capital letters harm it.
Here is a (slightly mischievous) proposal.
Allow the Unicode non-breaking space character (nbsp; in HTML) as a
Malcolm == Malcolm Wallace malcolm.wall...@cs.york.ac.uk writes:
there is enough experimentally determined about reading in
general to be certain that visible gaps between words
materially improves readability, and internal capital letters
harm it.
Malcolm Here is a
On Thu, Dec 10, 2009 at 12:54 AM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
Given the amazinglyUglyAndUnreadably baStudlyCaps namingStyle that
went into Haskell forNoApparentReasonThatIHaveEverHeardOf
Compare:
someCoolFunc fstParam sndParam fooBarBazQuux
some_cool_func fst_param snd_param
2009/12/11 Johannes Laire johannes.la...@gmail.com:
On Thu, Dec 10, 2009 at 12:54 AM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
Given the amazinglyUglyAndUnreadably baStudlyCaps namingStyle that
went into Haskell forNoApparentReasonThatIHaveEverHeardOf
Compare:
someCoolFunc fstParam
On 10/12/2009 17:48, Bryan O'Sullivan wrote:
On Thu, Dec 10, 2009 at 5:01 AM, Johann Höchtl johann.hoec...@gmail.com
mailto:johann.hoec...@gmail.com wrote:
Yes. I'm working on a patch at the moment.
Is there something planed to happen in 2010?
Retooling the I/O manager isn't a
On Friday 11 December 2009 3:24:03 am pbrowne wrote:
The issue of *purity* in Haskell and this thread has confused me.
At value level (not type level) is this linked with *equational reasoning*?
Are the operational semantics of Haskell similar but not the same as
equational logic?
Why are
Bryan O'Sullivan b...@serpentine.com writes:
If I develop the time and energy to take a serious crack at it, I will
post here to let people know. This would be an effort where having
multiple people work on different implementations concurrently would
be a shame.
I'm interested in this topic
Gregory Collins wrote:
Bryan O'Sullivan b...@serpentine.com writes:
If I develop the time and energy to take a serious crack at it, I will
post here to let people know. This would be an effort where having
multiple people work on different implementations concurrently would
be a shame.
2. why depth and not size (= total number of constructors)?
That seems harder to generate terms compositionally. To create all
terms of depth n+1 you just glue together all terms of depth n, but to
create terms of size n+1 you need to glue 1 with n, 2 with n-1 etc.
So?
One would fear that
Dan,
From your example, I can appreciate the value of purity. But I am still
unsure how close Haskell terms are to pure *equational logic*[1]. The
operational semantics of languages like CafeOBJ[1] are very close to
their intended logical semantics. CafeOBJ modules contain theories in
equational
On Dec 10, 2:38 pm, Bulat Ziganshin bulat.zigans...@gmail.com wrote:
Hello Sebastian,
Thursday, December 10, 2009, 4:27:49 PM, you wrote:
The killer app for that, IMO, is parallelism these days
btw, are you seen Google App Engine? it's python/java ATM, but i think
that haskell will be
Johann Höchtl johann.hoec...@gmail.com writes:
I think the overall goal should be to get rid of
http://github.com/gregorycollins/event/blob/master/src/System/Event/EPoll.hsc,
as it's in the core.
I don't follow, could you explain?
Any non-blocking call to select should be save to replace
How are things like this handled in say - Morrow - using extensible
records? I guess when one defines functions operating on extensible
records you get a lot of reuse for free (in Andrew's example, you
would just extend the record with either a Checked or Unchecked label)
On Fri, Dec 11, 2009 at
On Fri, Dec 11, 2009 at 10:04 AM, pbrowne patrick.bro...@comp.dit.ie wrote:
Two questions
1) Is this correspondence between operational and logical semantics a
desirable property of *purity* in the Haskell world?
2) What, if anything, prevents the execution of a Haskell term from
being a
On Friday 11 December 2009 1:06:39 pm Luke Palmer wrote:
That's how I see it as a user of the language. At the most abstract
level, omitting some of the practical details of the language (such as
the built-in numeric types), Haskell's reduction follows beta
reduction with sharing, and so at
Gregory Collins wrote:
Johann Höchtl johann.hoec...@gmail.com writes:
I think the overall goal should be to get rid of
http://github.com/gregorycollins/event/blob/master/src/System/Event/EPoll.hsc,
as it's in the core.
I don't follow, could you explain?
I might be wrong, but
Johann Höchtl johann.hoec...@gmail.com writes:
I might be wrong, but it's EPoll.hsc where you define the call to the Linux
kernel function. This would be unneccessary, when poll (and kqueue and Windows
equivalents) are already in the core. Ok, a bit more than EPoll.hsc would be
unneccessary
Luke Palmer wrote:
I admit that I don't fully know what you are talking about. What do
you mean by logical meaning -- as opposed to what other sort of
meaning?
Consider Maude's rewrite logic RWL[1] which has similar inference rules
as equational logic(EL), but without the symmetry rule. From
On 10/12/09 12:07, Magnus Therning wrote:
As I understand it it all started with laziness. I don't know if
laziness is impossible without purity, but talks and papers tend to
say something like laziness has kept Haskell pure.
This is true, but laziness has its own advantages. Suppose I have
Stephen Tetley wrote:
C'mon Andrew - how about some facts, references?
Facts I can do. References? Not so much...
1. Code optimisation becomes radically easier. The compiler can make very
drastic alterations to your program, and not chance its meaning. (For that
matter, the programmer can
On Fri, Dec 11, 2009 at 11:46 AM, Andrew Coppin
andrewcop...@btinternet.com wrote:
On the other hand, turn up the optimisation settings on a C compiler high
enough and the program breaks.
Not if you write actual C as specified by the standard.
In fact, these days gcc internally converts your
2009/12/10 Luke Palmer lrpal...@gmail.com:
I always meet with armies of resistance when I say this...
The troops arrive.
...but unsafePerformIO should die a horrible, unforgiven
death. Well what if you want blah blah blah with a pure
interface? My response: too fscking bad!
Wouldn't
hackage is success because:
a) many (most) people do use it (by uploading packages)
b) it is a comprehensive list of availible packages if not the most
comprehensive one
Duncan, can you write about your concerns briefly why some maintainers may
dislike
this idea ?
Hackage is missing one
On Dec 11, 2009, at 3:55 PM, Jason Dusek wrote:
There are plenty of bad ways to use `unsafePerformIO`, this is
true; but as we already have a tool for binding to native code
in a way that trusts it to be pure, I don't see how having a
way to bind to nominally side-effecting Haskell code
Hi folks, and specially Simon Marlow,
I know I should probably be asking to the GHC list, but is there any update
on 6.12 since October? Any probable release date?
BTW, is there any feature list for the release?
Thank all of you involved in bringing this new version to life. GHC rocks!
On Fri, Dec 11, 2009 at 4:55 PM, Jason Dusek jason.du...@gmail.com wrote:
2009/12/10 Luke Palmer lrpal...@gmail.com:
I always meet with armies of resistance when I say this...
The troops arrive.
...but unsafePerformIO should die a horrible, unforgiven
death. Well what if you want blah blah
Quoth Luke Palmer lrpal...@gmail.com,
...
This is not the sort of resistance I expected :-). Naturally my
unrealistic argument applies to FFI as well; sin, if imported from C,
would have to return in an appropriate structure. Not necessarily IO
(I don't like the idea of a universal sin-bin
Luke Palmer wrote:
The idea being that any code that is pure could be evaluated anywhere
with a very simple interpreter. If you have pure code, you can trace
it back and evaluate it in a sandbox where you don't need a C runtime,
a linker, or really anything but the simplest substitution engine.
2009/12/11 Luke Palmer lrpal...@gmail.com:
The idea being that any code that is pure could be evaluated
anywhere with a very simple interpreter. If you have pure
code, you can trace it back and evaluate it in a sandbox where
you don't need a C runtime, a linker, or really anything but
the
On Fri, Dec 11, 2009 at 7:00 PM, Marc Weber marco-owe...@gmx.de wrote:
hackage is success because:
a) many (most) people do use it (by uploading packages)
b) it is a comprehensive list of availible packages if not the most
comprehensive one
Duncan, can you write about your concerns
On Sat, 2009-12-12 at 01:00 +0100, Marc Weber wrote:
hackage is success because:
a) many (most) people do use it (by uploading packages)
b) it is a comprehensive list of availible packages if not the most
comprehensive one
Duncan, can you write about your concerns briefly why some
Hi,
Can anyone put me right here. I am trying to use a setup similar to
parMap to spark each valuation in a list in parallel, where the
resulting (evaluated) list is folded to produce a final single result.
Having done the obligatory google, I modified a few common examples to
give:
pfoldl f
Begin forwarded message:
Date: December 11, 2009 8:00:00 PM EST
Subject: Old math reveals new thinking in children's cognitive
development
Source: ScienceDaily: Latest Science News
Five-year-olds can reason about the world from multiple perspectives
simultaneously, according to a new
Hello, cafe!
It's an honor for me to announce my first two packages, I developed in
Haskell:
** http://hackage.haskell.org/package/PCLT
** http://hackage.haskell.org/package/PCLT-DB
PCLT is an abbreviation for Parametric Composable Localizable Templates
- in fact it should also hold
Today we were working on integrating Atom code with some hand-written
C, and one of my colleagues posed the question: Is it possible to use
Atom just for its task scheduler for existing C code? This turns out
to be very simple. It just requires a few combinators built on top of
'action'.
--
On Tue, Dec 8, 2009 at 6:31 PM, Tom Tobin korp...@korpios.com wrote:
Question 2 can be If the answer to 1 is no, is there *any*
circumstance under which the author of Y can distribute the source of
Y under a non-GPL license?
I'd like to get these questions out to the SFLC so we can satisfy our
On Fri, Dec 11, 2009 at 9:21 PM, Brandon S. Allbery KF8NH
allb...@ece.cmu.edu wrote:
Unexpected applications of category theory for $500, Alex
Before you know it, they're going to be modeling mental processes as monads. :p
___
Haskell-Cafe mailing
I'm just noticing that -- comments don't seem to work properly when the first
character following them is a '*'.
Michael
--*I like asterisks
--*I like asterisks
--*I like asterisks
--*I like asterisks
double x = x+x
Prelude :l double
[1 of 1] Compiling Main ( double.hs,
let (--*) = (+) in 5 --* 6
=== 11
The comment is introduced by -- followed by a non-symbol (because if
followed by a symbol, it might be an operator)
Hope this helps!
Dan
On Fri, Dec 11, 2009 at 11:30 PM, michael rice nowg...@yahoo.com wrote:
I'm just noticing that -- comments don't seem to
On Dec 11, 2009, at 23:30 , michael rice wrote:
I'm just noticing that -- comments don't seem to work properly
when the first character following them is a '*'.
I believe the spec only treats -- as a comment leader; this is why
Haddock markup has a space between the -- and the markup.
Cool! Didn't know that, and the Haskell syntax I looked up made no mention of
it.
Thanks,
Michael
--- On Fri, 12/11/09, Daniel Peebles pumpkin...@gmail.com wrote:
From: Daniel Peebles pumpkin...@gmail.com
Subject: Re: [Haskell-cafe] -- comments
To: michael rice nowg...@yahoo.com
Cc:
I'd seen Haddock occasionally mentioned in posts but hadn't gotten to it yet.
Looks interesting.
Thanks,
Michael
--- On Fri, 12/11/09, Brandon S. Allbery KF8NH allb...@ece.cmu.edu wrote:
From: Brandon S. Allbery KF8NH allb...@ece.cmu.edu
Subject: Re: [Haskell-cafe] -- comments
To: michael
I was wondering how many haskell consultants and contractors
(ie. freelance programmers) there are and how much demand there
is for their work. Also what kind of work do most haskell
consultants and contractors get? Is it primarily focused
around developing and maintaining haskell compilers and
Andrew Coppin wrote:
On the other hand, turn up the optimisation settings on a C compiler
high enough and the program breaks. Somewhere the compiler elides a
second call to a function which actually happens to have some
side-effect that the compiler isn't aware of, and your stream is now one
-- Forwarded message --
From: Ravi Nanavati rav...@alum.mit.edu
Date: Sat, Dec 12, 2009 at 1:44 AM
Subject: Next meeting: December 17th at MIT (32-G882)
To: bostonhask...@googlegroups.com
I'm pleased to announce the December meeting of the Boston Area
Haskell Users' Group.
The
47 matches
Mail list logo
