I have been subscribed to this list for over 20 years but these days all I ever
see are announcements of conferences which have at best a tangential
relationship with Haskell. Maybe it is time to call it a day?
Dominic Steinitz
domi...@steinitz.org
http://idontgetoutmuch.org
Twitter
package/diagrams-contrib-1.3.0.7/docs/Diagrams-TwoD-Layout-Tree.html>.
Dominic Steinitz
domi...@steinitz.org
http://idontgetoutmuch.wordpress.com
___
Haskell mailing list
Haskell@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell
-requ...@haskell.org wrote:
> I'm sorry to announce that this year haskell.org was not accepted for the
> 2016 Google Summer of Code.
>
>
Dominic Steinitz
domi...@steinitz.org
http://idontgetoutmuch.wordpress.com
___
Haskell mailing list
Ha
Hi,
The release timetable
http://trac.haskell.org/haskell-platform/wiki/ReleaseTimetable says
there will be a new release of the Haskell Platform in May. Can someone
give an update on this?
Many thanks, Dominic.
___
Haskell mailing list
Haskell@ha
Norman Ramsey cs.tufts.edu> writes:
>
> I've got a fairly large GADT for which I wished to use
>deriving (Show)
You will have to write one by hand. I tend to use Text.Pretty and then the
output is much more readable. It doesn't take long even for a what I would
consider a large GADT.
__
> I am hoping some of you may have suggestions about other papers that
> would be good tutorials in the use of GADTs.
>
> Norman
>
Norman,
This is very much in a state of flux but it may be worth taking a look at
http://code.haskell.org/asn1/ASNTYPE.lhs. There's also
http://www.haskell.org/haske
I'm doing
darcs get http://www.haskell.org/crypto
at the moment but it's just hanging.
Is there a problem on the server?
Thanks, Dominic.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
I'd like to announce the release of a new version of the library
following various contributions (contributors are bcc'd).
Additions include: BubbleBabble, TEA, HMAC and more large word support.
It no longer includes Base64. This is provided by
http://hackage.haskell.org/cgi-bin/hackage-scripts/p
I should like to announce the release of a new version of the Haskell
Cryptographic Library based on the proposal at
http://www.haskell.org/haskellwiki/Crypto_Library_Proposal.
See http://www.haskell.org/crypto/ for more details. There is now no
dependency on NewBinary. The downside is the libr
After a lay off from Haskell for a few months and preparatory to Hac 07,
I thought I had better check my laptop was appropriately set up.
However, I encountered the following:
C:\Documents and Settings\Owner\crypto>Setup build
Preprocessing library Crypto-3.1.0...
Preprocessing executables for
What's the betting they all have Base64 in them.
Base64 is like a virus; everyone seems to have their own copy. I put it in the
crypto library (along with MD5 another virus-like module) in the hope that we
would end up with one version of both. Clearly that hasn't worked.
Any suggestions?
Dom
Henrik Nilsson wrote:
Hi Dominic,
> Does anyone know where the source code for Yampa Arcade can be found?
It's included with the (now very old) afrp-0.4 distribution available
from
www.haskell.org/yampa
It's in the examples/SpaceInvaders directory.
Hope that helps!
All the best,
/Henri
Does anyone know where the source code for Yampa Arcade can be found?
Googling "yampa arcade" turned up this
http://www.cs.hmc.edu/courses/2006/spring/cs182-3/afrp/ but I was
expecting to find it stand alone rather than as part of a lecture course.
Thanks, Dominic.
___
Taral wrote:
On 5/28/06, Dominic Steinitz <[EMAIL PROTECTED]> wrote:
Is this defined in some library? Thanks, Dominic.
Don't think so. I use:
\a b -> f (g a b)
Taral,
Thanks. What prompted this question is that I find myself writing things
like:
foo = ((.).(.)) concat
Is this defined in some library? Thanks, Dominic.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
What a great error message:
qcgadt.hs:115:7:
My brain just exploded.
I can't handle pattern bindings for existentially-quantified constructors.
In the binding group
(Rep x) = uncompressRep s
In the definition of `uncompressRep':
uncompressRep (0 : 1 : 0 : s) = let (
Has anyone got any examples of these working together?
Thanks, Dominic.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
I'm getting
[EMAIL PROTECTED] pcap]# ./test
test: Socket.hsc:(1434,17)-(1523,20): Non-exhaustive patterns in case
The problem is caused because pcap_findalldevs is returning an address family
value of 17
#define PF_PACKET 17 /* Packet family. */
#define AF_PACKET PF_PACKET
a
I should like to announce a new version of the Haskell Cryptography Library.
Version 3.0.3 supports:
• DES
• Blowfish
• AES
• Cipher Block Chaining (CBC)
• PKCS#5 and nulls padding
• SHA-1
• MD5
• RSA
• OAEP-based encryption (Bellare-Rogaway)
• PKCS#1v1.5 signature scheme
• ASN.1
• PKCS#8
• X.50
Simon Peyton-Jones microsoft.com> writes:
>
> I really like the way you use a set of constraints
> (IN m1 ms, IN m2 ms, IN m3 ms)
> to maintain the set of marks. Previously I've thought of using a nested
> tuple type
> (m1, (m2, (m3 (
> to maintain the set, but that is far less
Simon Marlow microsoft.com> writes:
>
> I have installed darcsweb on darcs.haskell.org. To browse the available
> darcs repositories, go here:
>
> http://darcs.haskell.org/darcsweb
>
> It's also available as http://hackage.haskell.org/darcsweb.
>
> Note that currently I have omitted GHC, th
On Sunday 15 May 2005 8:24 pm, Dominic Steinitz wrote:
> >On Sun, 2005-05-15 at 18:51 +0100, Dominic Steinitz wrote:
> >>/ > Dominic Steinitz writes:
> >
> >/>/ >
> >/>/ I've downloaded
> >/>/
> > http://www.haskell.org/ghc/docs/la
On Sun, 2005-05-15 at 18:51 +0100, Dominic Steinitz wrote:
/ > Dominic Steinitz writes:
/>/ >
/>/ I've downloaded
/>/ http://www.haskell.org/ghc/docs/latest/html/libraries/base/base.haddock and I
/>/ still get the same errors. Is this incompatible with Haddock version 0.6
> Dominic Steinitz writes:
>
> > I've now used the -v option and it looks like haddock
> > can't find the html files even though they are there :-(
> > Anyone have any ideas?
>
> Maybe the interface description files are broken,
> incomplete
On Saturday 14 May 2005 2:01 pm, Dominic Steinitz wrote:
> > On Sat, 2005-05-14 at 13:05 +0100, Dominic Steinitz wrote:
> > > Can someone point out what I am doing wrong?
> > >
> > > Thanks, Dominic.
> > >
> > > [dom at tility Codec
> On Sat, 2005-05-14 at 13:05 +0100, Dominic Steinitz wrote:
> > Can someone point out what I am doing wrong?
> >
> > Thanks, Dominic.
> >
> > [dom at tility Codec]$ haddock Codec/Utils.hs
> >
--read-interface=http://www.haskell.org/ghc/docs/latest/htm
Can someone point out what I am doing wrong?
Thanks, Dominic.
[EMAIL PROTECTED] Codec]$ haddock Codec/Utils.hs
--read-interface=http://www.haskell.org/ghc/docs/latest/html/base,/usr/share/doc/ghc-6.4/libraries/base/base.haddock
Warning: Codec.Utils: the following names could not be resolved:
Axel Simon wrote:
> > > Does anyone know why these are in the IO monad? Aren't they
> pure functions
> > > > converting between dotted-decimal strings and a 32-bit network
byte ordered
> > > > binary value?
> >
> > I guess the answer is no for both: The first one can fail
>
That doesn't mean t
Does anyone know why these are in the IO monad? Aren't they pure functions
converting between dotted-decimal strings and a 32-bit network byte ordered
binary value?
Dominic.
http://www.haskell.org/ghc/docs/latest/html/libraries/network/Network.Socket.html#v%3Ainet_addr
http://www.haskell.org/gh
I would like to announce the release of a new version of the Haskell
Cryptographic Library. It now uses darcs and cabal and provides the
modules listed below. The most significant change is in the way ASN.1 is
handled. This has been made generic enough to handle PKCS#8 private keys
and X.509 ce
Can someone explain why this works? I would have expected an error when the
typechecker tries to unify m with (StateT [Encoding] m).
Dominic.
*Codec.ASN1.BER> :t (tc absInteger (Primitive Universal 2 1 [0]))
(tc absInteger (Primitive Universal 2 1 [0])) ::
forall m e. (MonadError e m) => m Defa
On Sunday 09 Jan 2005 12:43 pm, Dominic Steinitz wrote:
> some utilities in it, see http://www.haskell.org/Codec/index.html.
Of course that should have been http://www.haskell.org/Codec
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.
Partly by way of experiment with darcs and Cabal and partly because I am
restructuring the cryptographic library, I have set up a Codec package with
some utilities in it, see http://www.haskell.org/Codec/index.html. Currently
it contains only the module Codec.Utils.
To get the package:
darcs g
Please ignore my last message. I assume the answer is that Char' a is
replaced everywhere by Char before the typechecker gets a look in.
Dominic.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Main> :t baz
baz :: Foo a => Char' a -> a
Main> :t v
v :: Char' BW
Main> :t test1
test1 :: Bool
Main> :t (baz v)
baz v :: Foo a => a
Why doesn't the typechecker unify Char' BW with a and therefore the type
of test1 = baz v becomes Char' BW resulting in a type error by not being
able to unify Char
I'd be grateful for some help on using HaXml.
1. I can parse a String into a Document but it's not clear how you operate on
it as the combinators all operate on Content. The only function I could find
that operated on a Document was "document" in Pretty.
2. I can construct a CFilter but it's no
[EMAIL PROTECTED] wrote:
instance (Ord a, Bits a, Bounded a, Integral a, LargeWord a,
Bits b, Bounded b, Integral b, LargeWord b) =>
Bounded (LargeKey a b) where
minBound = 0
maxBound =
fromIntegral $
(1 + fromIntegral (maxBound::b))*
(1
[EMAIL PROTECTED] wrote:
instance (Ord a, Bits a, Bounded a, Integral a, LargeWord a,
Bits b, Bounded b, Integral b, LargeWord b) =>
Bounded (LargeKey a b) where
minBound = 0
maxBound =
fromIntegral $
(1 + fromIntegral (maxBound::b))*
(1
Probable fix:
Add (Bounded b) to the expected type of an expression
When checking the type signature of the expression:
maxBound :: forall b. b
which does at least point to the error.
Simon
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf
Can someone remind me how to change the number of tests that QuickCheck
performs? I'm sure I knew how to do this but I can't find it in the
documentation and a web search revealed no examples.
Thanks, Dominic.
___
Haskell mailing list
[EMAIL PROTECTED]
GHC accepts this with -fglasgow-exts
instance (Ord a, Bits a, Bounded a, Integral a, LargeWord a,
Bits b, Bounded b, Integral b, LargeWord b) =>
Bounded (LargeKey a b) where
minBound = 0
maxBound =
fromIntegral $
(1 + fromIntegral (maxBound::b))*
x27;t
properly supported).
It now includes: DES, Blowfish, AES, Cipher Block Chaining (CBC) mode,
PKCS#5 and nulls padding, SHA-1, MD5, RSA, OAEP, ASN.1 and PKCS#8.
Dominic Steinitz
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/ma
).
Dominic Steinitz
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
-1
· RSA
· OAEP
· ASN.1
· PKCS#8
Dominic Steinitz
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Does anyone have any views on how to "wrap" code that has been designed to
take input from handles but you now want to take input from strings? I want
to make minimal changes to a module that already works and to code that uses
that module. Here's my thinking below. I'd be interested in other appro
.
·Can be used with the standard mode and padding algorithms (in the
case of block mode ciphers).
This release contains:
·DES
·Blowfish
·Cipher Block Chaining (CBC) mode
·PKCS5 and nulls padding
·SHA-1
·RSA
·OAEP
Dominic Steinitz
Ross,
Thanks very much. I was going to use
coal :: Vector a -> [a]
coal = coal_ (\() -> []) (\x -> [x])
but I prefer your definitions.
Dominic.
- Original Message -
From: "Ross Paterson" <[EMAIL PROTECTED]>
To: "Dominic Steinitz" <[EMAIL PR
nfinite type: t = (t, t1)
Expected type: (t, t1)
Inferred type: t
In the first argument of `coalw', namely `w1'
In the first argument of `(++)', namely `(coalw w1)'
Failed, modules loaded: none.
- Original Message -----
From: "Brandon Michael Moore"
Can anyone tell me why the following doesn't work (and what I have to do to
fix it)? I thought by specifying the type of coalw as rank-2 would allow it
to be used both at a and (a,b).
Dominic.
Reading file "Test.hs":tten
Type checking
ERROR "Test.hs":18 - Inferred type is not general enough
*** E
I realise I have to give an explicit type for the functions but this still
doesn't get rid of the warnings.
Dominic.
- Original Message -
From: "Dominic Steinitz" <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Monday, August 18, 2003 6:06 PM
Subject: Haddo
: Prelude
Warning: Codec.Encryption.DES: the following names could not be resolved:
encrypt decrypt
Here's the offending module.
-
-- |
-- Module : Codec.Encryption.DES
-- Copyright : (c) Dominic Steinitz
Could someone explain to me why this
doesn't work
test l =
hs
where hs = map (\x ->
[x]) [0..abs(l `div` hLen)]
hLen = length $ head hs
whereas this does
test l =
hs
where hs = map (\x ->
[x]) (0:[1..abs(l `div`
hLen)]) hLen =
lengt
.
·Can be used with the standard mode and padding algorithms (in the
case of block mode ciphers).
This very initial release contains:
·DES
·Blowfish
·Cipher Block Chaining (CBC) mode
·PKCS#5 and nulls padding
Dominic Steinitz
Is this a recent change? I've downloaded Ian Lynagh's DES module and it
doesn't compile because of this. I assume it used to. I don't see the
rationale for this. I can see Bool can be an instance of Bit but why does it
need to be an instance of Num?
Dominic Steinitz
--
module Main(main) where
import Bits
instance Bits Bool where
complement False = True
complement True = False
Dominic Steinitz
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
doing).
Dominic Steinitz
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
I have summarised the responses I have received and cross posted this to
Haskell-Cafe in case anyone wishes to carry on the conversation.
> In a moment of weakness, I offered to help a friend develop a website.
It's
> a simple database application which carries out very little calculation
and
> th
L
2. Use MySQL-HS which requires HaskellDirect or use HSQL.
I'd be very grateful for any advice and any progress as a result of the
discussion in June.
Dominic Steinitz
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
1,ct
Picose
c=0,ctWDay=Thursday,ctYDay=149,ctTZName="BST",ctTZ=3600,ctIsDST=True}
Dominic Steinitz
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
I've managed to crack something that always annoyed me when I used to do
network programming. However, Hugs and GHC behave differently. I'd be
interested in views on this approach and also which implementation behaves
correctly.
Suppose I want to send an ICMP packet. The first byte is the type an
Finn, Thanks for this. I thought since I wasn't actually using the socket module I wouldn't have to use withSocketsDo.The documentation for BSD is a little spartan and a few explanatory words about how errors get handled wouldn't go amiss.Anyway, it now works so I'll move on to the next bit.Domini
61 matches
Mail list logo