listed. I am grateful that
minorities are explicitly called out and strongly encouraged to apply in
this announcement. I am confident that haskell.org will make every effort
to support and empower all applicants.
-- Dan Burton
On Fri, Mar 16, 2018 at 4:06 AM, Tillmann Vogt <tillmann.v...@r
pervasive assumption that sandboxing will be
involved.
On Nov 13, 2017 14:45, "Evan Laforge" <qdun...@gmail.com> wrote:
On Mon, Nov 13, 2017 at 12:27 PM, Dan Burton <danburton.em...@gmail.com>
wrote:
> I also lean towards the "you shouldn't be trying to uninstall" men
I also lean towards the "you shouldn't be trying to uninstall" mentality.
But it's worth discussing.
What is the motive for uninstalling? Is it to upgrade to a new version? To
narrow hoogle search results? For these, our sandbox tooling should allow
for upgrades or selective querying without
+1 please update 7.8.3 - 7.8.4. Consider also providing the minghc-7.10.1
link as well. Or just link to the github readme, which has these options
and various relevant explanations:
https://github.com/fpco/minghc#readme
n.b. for some reason Howard's email landed in my spam box.
-- Dan Burton
from a Cache is thread safe: only one fallback will execute at a
time, and after the first successful fallback, the cached value will be set
and no other fallbacks will be called.
-- Dan Burton
___
Haskell mailing list
Haskell@haskell.org
http
`serverSide` out into a typeclass, such as
ApplicativeIO? Sure. but why bother? The point is, you've got the
specialization you need already.
-- Dan Burton
On Tue, Oct 1, 2013 at 1:20 AM, Tom Ellis
tom-lists-haskell-cafe-2...@jaguarpaw.co.uk wrote:
On Tue, Oct 01, 2013 at 09:29:00AM +0200, Niklas Haas
The offending HTML is on line 93:
pbr//p
When I delete this paragraph element from the DOM, the ugly white bar goes
away.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Apparently that element is generated by the wiki software, since most pages
want the view source / history buttons above the rest of the content.
jQuery('#mw-content-text p:first').hide()
-- Dan Burton
On Tue, Oct 1, 2013 at 8:17 AM, Dan Burton danburton.em...@gmail.comwrote:
The offending
Interesting. It's similar in spirit to basically a safe Coerce typeclass,
but for * - * types.
class Coerce a b where
coerce :: a - b
class Coerce1 f g where
coerce1 :: f a - g a
-- Dan Burton
On Tue, Oct 1, 2013 at 11:00 AM, John Wiegley jo...@fpcomplete.com wrote
an optimization guru:
allPairsS :: [a] - [(a, a)]
allPairsS xs = go xs [] where
go [] = id
go (y:ys) = (map (\a - (y, a)) ys ++) . go xs
Further reading:
http://www.haskell.org/haskellwiki/Difference_list
-- Dan Burton
On Tue, Sep 3, 2013 at 3:28 PM, Scott Pakin pa...@lanl.gov wrote:
I'm
This is indeed a job for lens, particularly, the Iso type, and the under
function. Lens conveniently comes with a typeclassed isomorphism called
reversed, which of course has a list instance.
under reversed (take 10) ['a'.. 'z']
qrstuvwxyz
-- Dan Burton
On Aug 17, 2013 10:23 AM, Anton Nikishaev
Burton
On Sat, Aug 17, 2013 at 1:43 PM, Dan Burton danburton.em...@gmail.comwrote:
This is indeed a job for lens, particularly, the Iso type, and the under
function. Lens conveniently comes with a typeclassed isomorphism called
reversed, which of course has a list instance.
under reversed
an
automatic instance for Applicative, which I brought up about a month ago on
reddit:
http://www.reddit.com/r/haskell/comments/1ivd23/default_functor_and_applicative_instances_for/
-- Dan Burton
On Fri, Aug 16, 2013 at 7:52 AM, Brandon Allbery allber...@gmail.comwrote:
On Fri, Aug 16, 2013
of the Arrow are
also in scope.
This really helped solidify the idea in my head that the shape of the
factory only makes static choices, because all of the Arrow-y processing
happens between - and -
-- Dan Burton
On Fri, Aug 16, 2013 at 12:37 PM, Mathijs Kwik math...@bluescreen303.nlwrote:
Thiago
.
I imagine you could write some fancy hack that uses the type system to
automatically promote values to Oneples of the given value when an
expected: Oneple Foo, actual: Foo error occurs. But this would not be
very useful in general.
An uglier option:
type Oneple a = (a, ())
-- Dan Burton
in scope unqualified, so maybe lift would not be the best choice.
-- Dan Burton
On Aug 6, 2013 7:38 AM, Tom Ellis
tom-lists-haskell-cafe-2...@jaguarpaw.co.uk wrote:
On Tue, Aug 06, 2013 at 04:26:05PM +0200, Jerzy Karczmarczuk wrote:
1. First, it is not true that you can do with, say, (printStr
I am not trying to say every building is a shelter, rather anything
that is a building must provide sheltering services.
Well if it walks like a shelter and quacks like a shelter... /shrug
The is a relationship is not a good way to think about type classes, in
my opinion. The interface or
few weeks. I can promise to occasionally
throw my opinion around as if it mattered, though. ;)
-- Dan Burton
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Sounds great. Lambdabot is an important icon to the Haskell community; it
will be nice to brush off the bitrot and make lambdabot easier for the
average Haskeller to install without having to rely on Cale keeping it
running on irc (grateful, though we are).
-- Dan Burton
On Feb 17, 2013 3:04 PM
from the
flexibility proffered to the rest of the language.
tl;dr give me easily extensible syntax, rather than having to run to GHC
devs every time I want a new or different flavor of sugar.
-- Dan Burton
___
Haskell-Cafe mailing list
Haskell-Cafe
*how
*that would lead to extensive abuse. Well, too powerful or not,
meta-programming should be more easily available at least at *some *layer
of language development without having to resort to hacking the compiler.
-- Dan Burton
___
Haskell-Cafe mailing
-- Dan Burton (801-513-1596)
On Tue, Nov 13, 2012 at 9:27 AM, Andreas Abel andreas.a...@ifi.lmu.dewrote:
After 2 days of shrinking 251 modules of source code to a few lines I
realized that modify in MonadState causes loop in mtl-2.1.
http://hackage.haskell.org/**packages/archive/mtl/2.1
!
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
import BasicPrelude
-- Dan Burton
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
!
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
import BasicPrelude
-- Dan Burton
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Sounds reasonable. We might want flags to go with it for silencing or
enabling that particular warning.
-- Dan Burton
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
, precisely, is the benefit of turning on PolyKinds for that file
without changing the code? If we're cpp'ing it in, then are there further
benefits that we could also reap by cpp'ing some code changes?
-- Dan Burton
___
Glasgow-haskell-users mailing list
be the case that the tuple version (if it were valid
Haskell) is less efficient because it can't take advantage of list fusion
and has to allocate the tuple instead.
-- Dan Burton
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman
.
Basic Prelude takes the approach of hooking into existing
data types and typeclasses, so it doesn't fix issues such as
making Functor a superclass of Monad.
Since Basic, Classy, and Modular Preludes are all still
currently highly experimental, feedback is much appreciated.
-- Dan Burton
include swaths of code
(see Control/Monad/Tardis.hs and tardis.cabal).
I'm not entirely sold on the naming conventions for the package (including
the package name),
and am open to suggestions.
-- Dan Burton
___
Haskell mailing list
Haskell@haskell.org
include swaths of code
(see Control/Monad/Tardis.hs and tardis.cabal).
I'm not entirely sold on the naming conventions for the package (including
the package name),
and am open to suggestions.
-- Dan Burton
___
Haskell-Cafe mailing list
Haskell-Cafe
I don't know if it is possible to add haddock to functions whose type
signatures are generated by template haskell.
Could the documentation be an argument of mkLenses?
Does haddock run on the template-haskell expanded code?
TH macros must have type Q [Dec]. Dec has no constructor for
the
lens definitions. Type inference should correctly determine the type of the
generated lenses, but I have structured the library code so that in the
future, type signatures can also be generated. Patches welcome!
http://hackage.haskell.org/package/lens-family-th
-- Dan Burton
},Foo {a = 3, b = 3},Foo {a =
4, b = 4}]
The data seems to pop out of nowhere. Even if Ord instances like the one
for Foo shouldn't exist, they almost certainly will anyways, because the
Haskell type system doesn't prevent them. Users of the library should be
informed accordingly.
Dan Burton
801-513
Convenience aside, doesn't the functor instance conceptually violate some
sort of law?
fmap (const 1) someSet
The entire shape of the set changes.
fmap (g . h) = fmap g . fmap h
This law wouldn't hold given the following contrived ord instance
data Foo = Foo { a, b :: Int }
instance Ord Foo
on github (with examples): https://github.com/DanBurton/netspec
--
Dan Burton
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
--
Dan Burton
danburton.em...@gmail.com
On Tue, Feb 21, 2012 at 7:11 PM, Dan Burton danburton.em...@gmail.comwrote:
Haskellers,
I'm pleased to announce the first public release of NetSpec, a little
Network library to simplify networking tasks that involve a fixed number of
connections, using
36 matches
Mail list logo
