Kangyuan Niu wrote:
Aren't both Haskell and SML translatable into System F, from which
type-lambda is directly taken?
The fact that both Haskell and SML are translatable to System F does
not imply that Haskell and SML are just as expressive as System
F. Although SML (and now OCaml) does have
Tsuyoshi Ito tsuyoshi.ito.2...@gmail.com wrote:
How can I use combinators like repeat, which takes a plain function as
an argument, in the arrow notation in a more readable way? Or am I
trying to do an impossible thing?
To answer your question: Arrow notation has no support for what you
Hi Eric (et Café),
On Thu, Jul 5, 2012 at 5:13 PM, Eric Kow wrote:
*[Everybody should write everything in Go?][m7] (28 May)
Ryan Hayes posted a small [snippet of Go][go-snippet] showing how
friendly he found it for writing concurrent programs, “No
pthread... not stupid
Ooh, nice catch. Fixed on the HTML version.
http://www.well-typed.com/blog/67
Subject line makes me wonder how often the digests get caught in people's spam
filters
Oh and while I'm at it, I'll take the opportunity to plug the PH Digest survey
(I'll be annoying and make a reminder post just
Dear Ertugrul,
Thank you for your input.
To answer your question: Arrow notation has no support for what you
want, so if you stick with it you will have to write the inner proc
explicitly.
Oh. I was afraid of that.
However: The code may look much nicer, if you use applicative style for
On Fri, Jul 6, 2012 at 4:03 PM, Eric Kow wrote:
Subject line makes me wonder how often the digests get caught in people's
spam filters
Oops! Should have removed that part before replying. I think it comes from
the university's mail server, and it's rather obnoxious. I tend to ignore
it.
As I was using predicates (a - bool) , it appeared the need for combining
them with a boolean operator (bool - bool - bool) in order to get a new
predicate
combining the previous two. So I wrote my function combinerPred (see code
below). While I think this is JUST ok, i'm feeling a monad in the
The link to the CUFP job posting is working now. (After I posted the
previous message I found in my inbox an email telling me that the post will
be live after it's been approved -- it is now). I was also able to post it
on Haskellers ( http://www.haskellers.com/jobs/14 ).
Posting on CUFP was
I'm pleased to announce the first release of lens-family-core and
lens-family.
This package provide first class(†) functional references. In addition to
the usual operations of getting, setting and composition, plus integration
with the state monad, lens families provide some unique features:
Hackage links for anyone as lazy as myself =).
http://hackage.haskell.org/package/lens-family-core
http://hackage.haskell.org/package/lens-family
--
Felipe.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Fri, Jul 6, 2012 at 2:11 PM, Sebastián Krynski skryn...@gmail.com wrote:
As I was using predicates (a - bool) , it appeared the need for combining
them with a boolean operator (bool - bool - bool) in order to get a new
predicate
combining the previous two. So I wrote my function
On Fri, Jul 06, 2012 at 03:17:54PM -0300, Felipe Almeida Lessa wrote:
On Fri, Jul 6, 2012 at 2:11 PM, Sebastián Krynski skryn...@gmail.com wrote:
As I was using predicates (a - bool) , it appeared the need for combining
them with a boolean operator (bool - bool - bool) in order to get a new
Hello Cafe,
Recently I've been playing with the implementation of an algorithm, for
which we already have highly-optimized implementations available (in
plain C/C++ as well as OCaml with calls to C through FFI).
The algorithm works on buffers/arrays/vectors/whatever you want to call
it, which
When using make (or, at least, GNU make) the -k option keeps going
as far as possible after a compilation error. It's handy during
developing--for instance, I know half of my code is busted, but I
just want to see if this file compiles. Is there a similar way to do
this with cabal? Thanks. --Omari
On Fri, Jul 6, 2012 at 1:06 PM, Nicolas Trangez nico...@incubaid.com wrote:
-- This fails:
-- Ambiguous type variable `a0' in the constraint:
-- (Storable a0) arising from a use of `sizeOf'
Here you can either tie a type knot using proxy types or you can use
the scoped type
On Fri, Jul 6, 2012 at 1:43 PM, Thomas DuBuisson thomas.dubuis...@gmail.com
wrote:
The block of memory is sufficiently aligned for any of the basic
foreign types that fits into a memory block of the allocated size.
That's not the same thing as a guarantee of 16-byte alignment, note, as
none
On 05/07/2012, Mikhail Vorozhtsov mikhail.vorozht...@gmail.com wrote:
Hi.
After 21 months of occasional arguing the lambda-case proposal(s) is in
danger of being buried under its own trac ticket comments. We need fresh
blood to finally reach an agreement on the syntax. Read the wiki
page[1],
Thanks, I think I understand it now.
Do you know why they switched over in GHC 6.6?
-Kangyuan Niu
On Fri, Jul 6, 2012 at 3:11 AM, o...@okmij.org wrote:
Kangyuan Niu wrote:
Aren't both Haskell and SML translatable into System F, from which
type-lambda is directly taken?
The fact that
On Fri, 2012-07-06 at 13:43 -0700, Thomas DuBuisson wrote:
On Fri, Jul 6, 2012 at 1:06 PM, Nicolas Trangez nico...@incubaid.com wrote:
-- This fails:
-- Ambiguous type variable `a0' in the constraint:
-- (Storable a0) arising from a use of `sizeOf'
Here you can either tie a
Following the announcement of lens-family, I'm pleased to announce
lens-family-th 0.1.0.0, a Template Haskell library supplying macros to
generate lens-family lenses for fields of data types declared with record
syntax.
Be warned that currently, type signatures are *not* generated alongside the
Whoops, my earlier answer forgot to copy mailing lists... I would love to
see \of, but I really don't think this is important enough to make case
sometimes introduce layout and other times not. If it's going to obfuscate
the lexical syntax like that, I'd rather just stick with \x-case x of.
On
I would like to announce the release of husk-scheme 3.5.6, a Scheme
extension language and stand-alone interpreter/compiler that I have been
developing. husk implements most of the Scheme R5RS
standardhttp://www.schemers.org/Documents/Standards/R5RS/HTML/including
advanced features such as
Hi!
The `constraints` package provides ways to manipulate objects of kind
`Constraint`. I need the same kind of manipulation, except that I need
to work with objects of kind `* - Constraint`. I.e. I need
parameterized constraints that can be applied to different types.
BTW, is there a
23 matches
Mail list logo
